Clean Python Solution - 100% Runtime
\n\nclass Solution:\n    def winningPlayerCount(self, n: int, pick: List[List[int]]) -> int:\n        \n        mat = [[0]*11 for _ in range(n)]\n\n        for 
\n```\nclass Solution:\n    def winningPlayerCount(self, n: int, pick: List[List[int]]) -> int:\n        \n        mat = [[0]*11 for _ in range(n)]\n\n        for i,j in pick:\n            mat[i][j] += 1\n\n        res = 0\n        for i in range(n):\n            for j in range(11):\n                if mat[i][j] > i:\n                    res += 1\n                    break\n\n        return res\n```\n\nQ2 Solution\nhttps://leetcode.com/problems/minimum-number-of-flips-to-make-binary-grid-palindromic-i/solutions/5581085/clean-python
['Python3']