C# | clean solution beats 100% using hash table
Code
![image.png](https://assets.leetcode.com/users/images/a4ae95c0-5470-40eb-9f70-e1dfc2f456f9_1737382879.3544333.png)

# Code
```csharp []
public class Solution {
    public int WinningPlayerCount(int n, int[][] pick) {
        var dict = new Dictionary<int, int>[n];
        int count = 0;
        foreach (int[] p in pick) {
            int player = p[0];
            int color = p[1];
            if (dict[player] == null) {
                dict[player] = new Dictionary<int, int>();
            }
            if (dict[player].ContainsKey(color) == false) {
                dict[player][color] = 0;
            }
            dict[player][color]++;
        }

        for (int i = 0; i < n; i++) {
            if (dict[i] != null) {
                foreach (var item in dict[i]) {
                    if (i < item.Value) {
                        count++;
                        break;
                    }
                }
            }
        }

        return count;
    }
}
```
['C#']