Merge pull request #3189 from itsmohitnarayan/main

Created: 0350-Intersection-of-two-arrays-II.py

Author: Ykhan799

Diff for: python/0079-word-search.py

@@ -25,7 +25,7 @@ def dfs(r, c, i):
             return res
 
         # To prevent TLE,reverse the word if frequency of the first letter is more than the last letter's
-        count = defaultdict(int, sum(map(Counter, board), Counter()))
+        count = sum(map(Counter, board), Counter())
         if count[word[0]] > count[word[-1]]:
             word = word[::-1]
 

Diff for: python/0350-intersection-of-two-arrays-ii.py

@@ -0,0 +1,17 @@
+class Solution:
+    def intersect(self, nums1: List[int], nums2: List[int]) -> List[int]:
+        counter1 = Counter(nums1)
+        counter2 = Counter(nums2)
+
+        # Using defaultdict to handle missing keys more efficiently
+        counter1 = defaultdict(int, counter1)
+        counter2 = defaultdict(int, counter2)
+
+        intersection = []
+
+        for num, freq in counter1.items():
+            min_freq = min(freq, counter2[num])
+            if min_freq > 0:
+                intersection.extend([num] * min_freq)
+
+        return intersection