Time: 53 ms (34.01%), Space: 16.6 MB (95.4%) - LeetHub

Author: Deepak5113

0350-intersection-of-two-arrays-ii/0350-intersection-of-two-arrays-ii.py

@@ -0,0 +1,16 @@
+class Solution:
+    def intersect(self, nums1: List[int], nums2: List[int]) -> List[int]:
+        nums1.sort()
+        nums2.sort()
+        i,j=0,0
+        intersection=[]
+        while i<len(nums1) and j<len(nums2):
+            if nums1[i]<nums2[j]:
+                i+=1
+            elif nums1[i]>nums2[j]:
+                j+=1
+            else:
+                intersection.append(nums1[i])
+                i+=1
+                j+=1
+        return intersection