add 2956

fishercoder1534 · fishercoder1534 · commit 0b92c10ba019 · 2024-07-31T15:21:55.000-07:00
diff --git a/paginated_contents/algorithms/3rd_thousand/README.md b/paginated_contents/algorithms/3rd_thousand/README.md
@@ -5,6 +5,7 @@
 | 2970 | [Count the Number of Incremovable Subarrays I](https://leetcode.com/problems/count-the-number-of-incremovable-subarrays-i/)                                                                                                         | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2970.java)                                       |                                      | Easy                                     |
 | 2965 | [Find Missing and Repeated Values](https://leetcode.com/problems/find-missing-and-repeated-values/)                                                                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2965.java)                                       |                                      | Easy                                     |
 | 2960 | [Count Tested Devices After Test Operations](https://leetcode.com/problems/count-tested-devices-after-test-operations/)                                                                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2960.java)                                       |                                      | Easy                                     |
+| 2956 | [Find Common Elements Between Two Arrays](https://leetcode.com/problems/find-common-elements-between-two-arrays/)                                                                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2956.java)                                       |                                      | Easy                                     |
 | 2942 | [Find Words Containing Character](https://leetcode.com/problems/find-words-containing-character/)                                                                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2942.java)                                       |                                      | Easy                                     |
 | 2937 | [Make Three Strings Equal](https://leetcode.com/problems/make-three-strings-equal/)                                                                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2937.java)                                       |                                      | Easy                                     |
 | 2932 | [Maximum Strong Pair XOR I](https://leetcode.com/problems/maximum-strong-pair-xor-i/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2932.java)                                       |                                      | Easy                                     |
diff --git a/src/main/java/com/fishercoder/solutions/thirdthousand/_2956.java b/src/main/java/com/fishercoder/solutions/thirdthousand/_2956.java
@@ -0,0 +1,34 @@
+package com.fishercoder.solutions.thirdthousand;
+
+import java.util.HashSet;
+import java.util.Set;
+
+public class _2956 {
+    public static class Solution1 {
+        /**
+         * Although verbose, this is more efficient and faster than using Java.streams
+         */
+        public int[] findIntersectionValues(int[] nums1, int[] nums2) {
+            Set<Integer> set1 = new HashSet<>();
+            for (int num : nums1) {
+                set1.add(num);
+            }
+            Set<Integer> set2 = new HashSet<>();
+            for (int num : nums2) {
+                set2.add(num);
+            }
+            int[] ans = new int[2];
+            for (int num : nums1) {
+                if (set2.contains(num)) {
+                    ans[0]++;
+                }
+            }
+            for (int num : nums2) {
+                if (set1.contains(num)) {
+                    ans[1]++;
+                }
+            }
+            return ans;
+        }
+    }
+}
