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. \nGroup the by player and
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\nGroup the by player and colors,\nFilter the array where the player number is lower to the count by color,\nSelect distinct values of players,\nReturn the count of elements.\n\n\n\n# Complexity\n- Time complexity: O(N)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(N)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```csharp []\npublic class Solution {\n    public int WinningPlayerCount(int n, int[][] pick) => pick\n        .GroupBy(m => new { Player = m[0], Color = m[1] })\n        .Where(m => m.Key.Player < m.Count())\n        .Select(m => m.Key.Player)\n        .Distinct()\n        .Count();\n}\n```
['C#']