PYTHON || ✔️ EXPLANATION FOR ALL ✔️||
UPVOTE IF HELPFUL\n\nWe count the continous occurances of characters.\nIf occurance is more than 2. -> Number of turns possible is ( Occurances - 2 )\nCompute t
**UPVOTE IF HELPFUL**\n\nWe count the continous occurances of characters.\nIf occurance is more than 2. -> Number of turns possible is **( Occurances - 2 )**\nCompute this and give answer on basis which player get more turns.\n\n![image](https://assets.leetcode.com/users/images/171e1e07-e8af-4fee-80d6-8fe5f405477f_1654401801.2858663.jpeg)\n\n\n\n```\nclass Solution:\n    def winnerOfGame(self, s: str) -> bool:\n        a=[]\n        p="C"\n        for i in s:\n            if i==p:\n                a[-1]+=1\n            else:\n                p=i\n                a.append(1)\n        odd,even=0,0\n        for i in range(len(a)):\n            if i%2:\n                odd += max(0,a[i]-2)\n            else:\n                even += max (0,a[i]-2)\n        if s[0]=="A" and even>odd:\n            return True\n        if s[0]=="B" and odd>even:\n            return True\n        return False\n```\n![image](https://assets.leetcode.com/users/images/03e414c8-0e97-4e3a-8ee5-3c0f5cfa08b5_1654401815.2794096.jpeg)\n
['Python', 'Python3']