Simple hashmap solution(dictionary)
\n# Complexity\n- Time complexity:O(N)\n Add your time complexity here, e.g. O(n) \n\n- Space complexity:O(N)\n Add your space complexity here, e.g. O(n) \n\n# 
\n# Complexity\n- Time complexity:O(N)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:O(N)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```python3 []\nclass Solution:\n    def winningPlayerCount(self, n: int, pick: List[List[int]]) -> int:\n        d={}\n        for s in pick:\n            i=""\n            for j in s:\n                i+=str(j)\n            if i in d:\n                d[i]+=1\n            else:\n                d[i]=1\n        a=set()\n        for i,j in d.items():\n            if j>int(i[0]):\n                a.add(i[0])\n        return len(a)\n```
['Array', 'Hash Table', 'Counting', 'Python3']