C# concise hashsets+linq solution
Code\n\npublic class Solution {\n    public int[] FindIntersectionValues(int[] nums1, int[] nums2) \n    {\n        var hs1 = new HashSet<int>(nums1);\n        
# Code\n```\npublic class Solution {\n    public int[] FindIntersectionValues(int[] nums1, int[] nums2) \n    {\n        var hs1 = new HashSet<int>(nums1);\n        var hs2 = new HashSet<int>(nums2);\n\n        return new int [] \n        {\n            nums1.Count(hs2.Contains),\n            nums2.Count(hs1.Contains)\n        };\n    }\n}\n```
['C#']