Time: 10 ms (12.08%), Space: 15.1 MB (6.15%) - LeetHub

Gaurav8604 · Gaurav8604 · commit 2460403d4717 · 2024-08-02T15:47:23.000+05:30
diff --git a/0349-intersection-of-two-arrays/0349-intersection-of-two-arrays.cpp b/0349-intersection-of-two-arrays/0349-intersection-of-two-arrays.cpp
@@ -0,0 +1,26 @@
+class Solution {
+public:
+    vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
+        unordered_set<int> s;
+        unordered_map<int,int> mp;
+        for(int x:nums1)
+        {
+            mp[x]=1;
+        }
+        for(int x:nums2)
+        {
+            s.insert(x);
+        }
+        for(int x:s)
+        {
+            mp[x]++;
+        }
+        vector<int> ans;
+        for(auto x:mp)
+        {
+            if(x.second>1)
+            ans.push_back(x.first);
+        }
+        return ans;
+    }
+};
