@common_element || simplest solution
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```cpp []
class Solution {
public:
    vector<int> findIntersectionValues(vector<int>& nums1, vector<int>& nums2) {
        set<int> s1(nums1.begin(), nums1.end());
        set<int> s2(nums2.begin(), nums2.end());
        int count1 = 0, count2 = 0;
        for (int i = 0; i < nums1.size(); i++)
            if (s2.contains(nums1[i]))
                count1++;
        for (int i = 0; i < nums2.size(); i++)
            if (s1.contains(nums2[i]))
                count2++;
        return {count1, count2};
    }
};
```
['Array', 'Counting', 'Ordered Set', 'C++']