3238. Find the Number of Winning Players
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```python3 []
from collections import defaultdict
from typing import List

class Solution:
    def winningPlayerCount(self, n: int, pick: List[List[int]]) -> int:
        player_picks = [defaultdict(int) for _ in range(n)]
        
        for player, color in pick:
            player_picks[player][color] += 1
        
        winning_players = 0
        for i in range(n):
            if any(count >= i + 1 for count in player_picks[i].values()):
                winning_players += 1
        
        return winning_players

```
['Python3']