feat: solve Striver SDE Sheet problem 343 - Intersection of Two Arrays II

Author: TechnoBlogger14o3

striver-sde-sheet/343-350-Intersection-of-Two-Arrays-II/README.md

@@ -0,0 +1,41 @@
+# Intersection of Two Arrays II (Easy)
+
+**Problem ID:** 350  
+**Problem Number:** 343  
+**Link:** https://leetcode.com/problems/intersection-of-two-arrays-ii
+
+## Problem Statement
+
+Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must appear as many times as it shows in both arrays and you may return the result in any order.
+
+ 
+Example 1:
+
+
+Input: nums1 = [1,2,2,1], nums2 = [2,2]
+Output: [2,2]
+
+
+Example 2:
+
+
+Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4]
+Output: [4,9]
+Explanation: [9,4] is also accepted.
+
+
+ 
+Constraints:
+
+
+	1 <= nums1.length, nums2.length <= 1000
+	0 <= nums1[i], nums2[i] <= 1000
+...
+
+## Solutions
+
+- Python: `solution.py`
+- Java: `solution.java`
+- JavaScript: `solution.js`
+
+**Note:** Solutions need to be implemented.

striver-sde-sheet/343-350-Intersection-of-Two-Arrays-II/solution.java

@@ -0,0 +1,7 @@
+// Solution for Intersection of Two Arrays II
+// Problem ID: 350
+// Link: https://leetcode.com/problems/intersection-of-two-arrays-ii
+
+class Solution {
+    // TODO: Implement solution
+}

striver-sde-sheet/343-350-Intersection-of-Two-Arrays-II/solution.js

@@ -0,0 +1,10 @@
+// Solution for Intersection of Two Arrays II
+// Problem ID: 350
+// Link: https://leetcode.com/problems/intersection-of-two-arrays-ii
+
+/**
+ * TODO: Implement solution
+ */
+var solve = function() {
+    // Implementation needed
+};

striver-sde-sheet/343-350-Intersection-of-Two-Arrays-II/solution.py

@@ -0,0 +1,8 @@
+# Solution for Intersection of Two Arrays II
+# Problem ID: 350
+# Link: https://leetcode.com/problems/intersection-of-two-arrays-ii
+
+class Solution:
+    def solve(self):
+        # TODO: Implement solution
+        pass