java hashmap solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```java []\nclass Solution {\n    public int winningPlayerCount(int n, int[][] pick) {\n        HashMap<Integer,Map<Integer,Integer>>map=new HashMap<>();\n        for(int i=0;i<pick.length;i++){\n            int arr[]=pick[i];\n            map.put(arr[0],new HashMap<>());\n        }\n\n        for(int i=0;i<pick.length;i++){\n            int arr[]=pick[i];\n            map.get(arr[0]).put(arr[1],map.get(arr[0]).getOrDefault(arr[1],0)+1);\n        }\n\n        int c=0;\n        for(int key:map.keySet()){\n            Map<Integer,Integer>m=map.get(key);\n            for(int key1:m.keySet()){\n                if(m.get(key1)>=key+1){\n                    c++;\n                    break;\n                }\n            }\n        }\n        return c;\n    }\n}\n```
['Hash Table', 'Counting', 'Java']