C++ || Simple solution || O(n)
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        vector<int> final(2, 0);\n\n        unordered_set<int> set_nums1(nums1.begin(), nums1.end());\n        unordered_set<int> set_nums2(nums2.begin(), nums2.end());\n\n        for (int i = 0; i < nums1.size(); i++) {\n            if (set_nums2.count(nums1[i]) > 0) {\n                final[0]++;\n            }\n        }\n\n        for (int i = 0; i < nums2.size(); i++) {\n            if (set_nums1.count(nums2[i]) > 0) {\n                final[1]++;\n            }\n        }\n\n        return final;\n    }\n};\n\n```
['C++']