c#, HashSets
Intuition\n Describe your first thoughts on how to solve this problem. \nWe can use HashSet<int> to have a fast Contains\n\n# Approach\n Describe your approach 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\nWe can use `HashSet<int>` to have a fast `Contains`\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n1. Build hash sets to have fast `Contains`\n2. Linq query \n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n$$O(m + n)$$\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n$$O(m + n)$$\n\n# Code\n```\npublic class Solution {\n    public int[] FindIntersectionValues(int[] nums1, int[] nums2) {\n        var hs1 = new HashSet<int>(nums1);\n        var hs2 = new HashSet<int>(nums2);\n\n        return new int[] {\n            nums1.Count(item => hs2.Contains(item)),\n            nums2.Count(item => hs1.Contains(item))\n        };    \n    }\n}\n```
['C#']