Add solution #2032

JoshCrozier · JoshCrozier · commit b9f8785518bf · 2025-05-05T19:33:14.000-05:00
diff --git a/README.md b/README.md
@@ -1,4 +1,4 @@
-# 1,698 LeetCode solutions in JavaScript
+# 1,699 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1558,6 +1558,7 @@
 2028|[Find Missing Observations](./solutions/2028-find-missing-observations.js)|Medium|
 2029|[Stone Game IX](./solutions/2029-stone-game-ix.js)|Medium|
 2030|[Smallest K-Length Subsequence With Occurrences of a Letter](./solutions/2030-smallest-k-length-subsequence-with-occurrences-of-a-letter.js)|Hard|
+2032|[Two Out of Three](./solutions/2032-two-out-of-three.js)|Easy|
 2033|[Minimum Operations to Make a Uni-Value Grid](./solutions/2033-minimum-operations-to-make-a-uni-value-grid.js)|Medium|
 2037|[Minimum Number of Moves to Seat Everyone](./solutions/2037-minimum-number-of-moves-to-seat-everyone.js)|Easy|
 2047|[Number of Valid Words in a Sentence](./solutions/2047-number-of-valid-words-in-a-sentence.js)|Easy|
diff --git a/solutions/2032-two-out-of-three.js b/solutions/2032-two-out-of-three.js
@@ -0,0 +1,41 @@
+/**
+ * 2032. Two Out of Three
+ * https://leetcode.com/problems/two-out-of-three/
+ * Difficulty: Easy
+ *
+ * Given three integer arrays nums1, nums2, and nums3, return a distinct array containing all
+ * the values that are present in at least two out of the three arrays. You may return the
+ * values in any order.
+ */
+
+/**
+ * @param {number[]} nums1
+ * @param {number[]} nums2
+ * @param {number[]} nums3
+ * @return {number[]}
+ */
+var twoOutOfThree = function(nums1, nums2, nums3) {
+  const set1 = new Set(nums1);
+  const set2 = new Set(nums2);
+  const set3 = new Set(nums3);
+  const count = new Map();
+
+  for (const num of set1) {
+    count.set(num, (count.get(num) || 0) + 1);
+  }
+
+  for (const num of set2) {
+    count.set(num, (count.get(num) || 0) + 1);
+  }
+
+  for (const num of set3) {
+    count.set(num, (count.get(num) || 0) + 1);
+  }
+
+  const result = [];
+  for (const [num, freq] of count) {
+    if (freq >= 2) result.push(num);
+  }
+
+  return result;
+};
