Easy bruteforce w/ hashmap
Intuition\n- Make a hashmap to store the number of balls of each color for each player\n- Then check if the max of color list satisfies the condition.\n# Comple
# Intuition\n- Make a hashmap to store the number of balls of each color for each player\n- Then check if the max of color list satisfies the condition.\n# Complexity\n- Time complexity:\nO(n)\n- Space complexity:\nO(1) since there are max 11 players and 11 colors\n# Code\n```python3 []\nclass Solution:\n    def winningPlayerCount(self, n: int, pick: List[List[int]]) -> int:\n        player_list = defaultdict(lambda: [0]*11)\n        for player, color in pick:\n            player_list[player][color] += 1\n        ans = 0\n        for player in player_list:\n            if max(player_list[player]) > player:\n                ans += 1\n        return ans\n```
['Python3']