🔥|| 2 MAP || CONTEST-9th DEC || C++||🔥
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    vector<int> findIntersectionValues(vector<int>& nums1, vector<int>& nums2) {\n        map<int,int>mp1;\n        map<int,int>mp2;\n        for(auto it: nums1)\n        {\n            mp1[it]++;\n        }\n        for(auto it: nums2)\n        {\n            mp2[it]++;\n        }\n        vector<int>res(2,0);\n        for(auto i: nums1)\n        {\n            if(mp2[i]>0)\n                res[0]++;\n        }\n         for(auto i: nums2)\n        {\n            if(mp1[i]>0)\n                res[1]++;\n        }\n        return res;\n        \n    }\n};\n```
['Hash Table', 'Ordered Map', 'C++']