INTERSECTION OF TWO ARRAYS .cpp

#include<bits/stdc++.h>
using namespace std;
class Solution
{
public:
     vector<int> intersection(vector<int> &nums1, vector<int> &nums2)
     {
          map<int, int> m;
          for (int i = 0; i < nums2.size(); i++)
          {
               m[nums2[i]]++;
          }

          set<int> v;
          for (int i = 0; i < nums1.size(); i++)
          {
               if (m.find(nums1[i]) != m.end())
               {
                    v.insert(nums1[i]);
               }
          }
          vector<int> ans;
          for (auto it : v)
          {
               ans.push_back(it);
          }

          return ans;
     }
};

// leetcode question - 349