C# One Line Linq Solutions
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \nSelect a new array wher
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\nSelect a new array where,\nThe first value is the count of repetitions of array 2 in the array 1.\nThe second value is the count of repetitions of array 1 in the array 2.\n\n\n# Complexity\n- Time complexity: O(N)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```csharp []\npublic class Solution {\n    public int[] FindIntersectionValues(int[] nums1, int[] nums2) => new int[] {\n        nums1.Count(m => nums2.Contains(m)),\n        nums2.Count(m => nums1.Contains(m))\n    };\n}\n```
['C#']