add 2032

fishercoder1534 · fishercoder1534 · commit 930a10dd9b87 · 2021-10-09T21:19:48.000-07:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                  
 |-----|----------------|---------------|--------|-------------|-------------
+|2032|[Two Out of Three](https://leetcode.com/problems/two-out-of-three/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2032.java) ||Easy||
 |2028|[Find Missing Observations](https://leetcode.com/problems/find-missing-observations/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2028.java) ||Medium||
 |2027|[Minimum Moves to Convert String](https://leetcode.com/problems/minimum-moves-to-convert-string/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2027.java) ||Easy||
 |2024|[Maximize the Confusion of an Exam](https://leetcode.com/problems/maximize-the-confusion-of-an-exam/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2024.java) ||Medium||
diff --git a/src/main/java/com/fishercoder/solutions/_2032.java b/src/main/java/com/fishercoder/solutions/_2032.java
@@ -0,0 +1,46 @@
+package com.fishercoder.solutions;
+
+import java.util.ArrayList;
+import java.util.HashSet;
+import java.util.List;
+import java.util.Set;
+
+public class _2032 {
+    public static class Solution1 {
+        public List<Integer> twoOutOfThree(int[] nums1, int[] nums2, int[] nums3) {
+            Set<Integer> ans = new HashSet<>();
+            Set<Integer> set1 = new HashSet<>();
+            for (int i : nums1) {
+                set1.add(i);
+            }
+            Set<Integer> set2 = new HashSet<>();
+            for (int i : nums2) {
+                set2.add(i);
+            }
+            Set<Integer> set3 = new HashSet<>();
+            for (int i : nums3) {
+                set3.add(i);
+            }
+            for (int i = 0; i < nums1.length; i++) {
+                if (set2.contains(nums1[i]) || set3.contains(nums1[i])) {
+                    ans.add(nums1[i]);
+                }
+            }
+            for (int i = 0; i < nums2.length; i++) {
+                if (set1.contains(nums2[i]) || set3.contains(nums2[i])) {
+                    ans.add(nums2[i]);
+                }
+            }
+            for (int i = 0; i < nums3.length; i++) {
+                if (set1.contains(nums3[i]) || set2.contains(nums3[i])) {
+                    ans.add(nums3[i]);
+                }
+            }
+            List<Integer> result = new ArrayList<>();
+            for (int i : ans) {
+                result.add(i);
+            }
+            return result;
+        }
+    }
+}
