EASY SOLUTION BEATS 100%
\n# Approach\nBy using Simple Arrays , No Hash Map.\nWe Make a Picking Array for each player to see how many balls they picked each color.\nIf the player picked
\n# Approach\nBy using Simple Arrays , No Hash Map.\nWe Make a Picking Array for each player to see how many balls they picked each color.\nIf the player picked atleast one color more than their number then the player won.\n\n# Complexity\n- Time complexity:\nO(N*pick.length)\n\n- Space complexity:\nO(N)\n\n# Code\n```java []\nclass Solution {\n    public int winningPlayerCount(int n, int[][] pick) {\n    int answer=0;\n    for(int j=0;j<n;j++)\n    {\n     int[] picking = new int[11];\n    for(int i=0;i<pick.length;i++)\n    {\n        int person=pick[i][0];\n        int color= pick[i][1];\n        if(person==j)\n        { \n        picking[color]++;\n        }\n    } \n     for(int i=0;i<picking.length;i++)\n     {\n        if(picking[i]>j)\n        {\n            answer+=1;\n            break;\n        }\n     }\n    }\n    return answer;\n    }\n}\n```
['Java']