Solution using hashmap
\n# Complexity\n- Time complexity:O(N)\n Add your time complexity here, e.g. O(n) \n\n- Space complexity:O(N)\n Add your space complexity here, e.g. O(n) \n\n# 
\n# Complexity\n- Time complexity:O(N)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:O(N)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```python3 []\nclass Solution:\n    def findIntersectionValues(self, nums1: List[int], nums2: List[int]) -> List[int]:\n        ans=[0,0]\n        d={}\n        for i in nums1:\n            d[i]=1\n        for i in nums2:\n            if i in d:\n                ans[1]+=1\n        d={}\n        for i in nums2:\n            d[i]=1\n        for i in nums1:\n            if i in d:\n                ans[0]+=1     \n        return ans\n        \n```
['Array', 'Hash Table', 'Python3']