C# using HashSet
Complexity\n- Time complexity: O(n)\n- Space complexity: O(n)\n\n# Code\n\npublic class Solution\n{\n    public int[] FindIntersectionValues(int[] nums1, int[] 
# Complexity\n- Time complexity: $$O(n)$$\n- Space complexity: $$O(n)$$\n\n# Code\n```\npublic class Solution\n{\n    public int[] FindIntersectionValues(int[] nums1, int[] nums2)\n    {\n        var set1 = new HashSet<int>(nums1);\n        var set2 = new HashSet<int>(nums2);\n        return new[] {nums1.Count(x => set2.Contains(x)), nums2.Count(x => set1.Contains(x))};\n    }\n}\n```
['C#']