✅Easy and Simple Solution ✅Clean Code
Guy\'s if you find this solution helpful \uD83D\uDE0A, PLEASE do UPVOTE. By doing that it motivate\'s me to create more better post like this \u270D\uFE0F\nFoll
***Guy\'s if you find this solution helpful \uD83D\uDE0A, PLEASE do UPVOTE. By doing that it motivate\'s me to create more better post like this \u270D\uFE0F***<br>\n**Follow me on LinkeDin [[click Here](https://www.linkedin.com/in/ayushluthra62/)]**\n\n\n\n\n# Complexity\n- Time complexity:\nO(N)\n\n- Space complexity:\nO(N)\n\n# Code\n```\nclass Solution {\npublic:\n    int winningPlayerCount(int n, vector<vector<int>>& pick) {\n        unordered_map<int,unordered_map<int,int>>mapping;\n        \n        for(int i=0;i<pick.size();i++){\n            int player = pick[i][0];\n            int ball = pick[i][1];\n            \n            mapping[player][ball]++;\n        }\n        \n        int count = 0;\n        \n        for(auto i : mapping){\n            int maxi =0;\n            int player  = i.first;\n            \n            for(auto j : i.second) {\n                maxi = max(maxi,j.second);\n            }\n            if(player< maxi) count++;\n        }\n        \n        return count;\n    }\n};\n```\n***Guy\'s if you find this solution helpful \uD83D\uDE0A, PLEASE do UPVOTE. By doing that it motivate\'s me to create more better post like this \u270D\uFE0F***<br>\n**Follow me on LinkeDin [[click Here](https://www.linkedin.com/in/ayushluthra62/)]**
['C++']