C++ || using nested hash map
Approach
Data Structure: Use a nested hash map to track the count of balls each player picks by color.
Process Input: Populate the map by iterating through the
# Approach
1. **Data Structure:** Use a nested hash map to track the count of balls each player picks by color.
2. **Process Input:** Populate the map by iterating through the `pick` array and updating counts.
3. **Check Winners:** Iterate through the map and determine if a player wins by having more than `i` balls of a single color (where `i` is their index).
4. **Count Winners:** Maintain and return a counter for the players who meet the winning condition.


# Code
```cpp []
class Solution {
public:
    int winningPlayerCount(int n, vector<vector<int>>& pick)
    {
        unordered_map<int, unordered_map<int, int>> game;
        for( const auto& p : pick)
        {
            game[p[0]][p[1]]++;
        }

        int winners = 0;
        for( const auto& result : game)
        {
            int p = result.first;
            auto c = result.second;
            for( const auto& check : c)
            {
                if( check.second > p )
                {
                    winners++;
                    break;
                }
            }
        }
        return winners;
    }
};
```
['C++']