Find the number of winning players
I have started by creating 2-dimensional array .
It will keep count of the pick and increement the value by one.
Then I check from the 0th player to end whether
I have started by creating 2-dimensional array .
It will keep count of the pick and increement the value by one.
Then I check from the 0th player to end whether they have picked any balls greater than i+1


Time Complexity: O(len + n).
Space Complexity: O(n).


# Code
```java []
class Solution {
    public int winningPlayerCount(int n, int[][] pick) {
        int len=pick.length;
        int arr[][]=new int[n][11];
        for(int i=0;i<len;i++)
        {
            int a=pick[i][0];
            int b=pick[i][1];
            arr[a][b]++;
        }
        int count=0;
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<11;j++)
            {
                if(arr[i][j]>=i+1)
                {
                    count++;
                    break;
                }
            }
        }
        return count;
    }
}
```
['Java']