Simple Approach and Answer. No fancy code
\n\n# Approach\n Describe your approach to solving the problem. \nSimply we can count the number of times Alice can pop and the number of times Bob can pop. And
\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\nSimply we can count the number of times Alice can pop and the number of times Bob can pop. And return whether Alice has the more count or not.\n\n# Complexity\n- Time complexity: O(n)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution:\n    def winnerOfGame(self, colors: str) -> bool:\n        a=b=0\n        for i in range(1,len(colors)-1):\n            if colors[i]==colors[i-1] and colors[i]==colors[i+1]:\n                if colors[i]==\'A\':\n                    a+=1\n                else:\n                    b+=1\n        return a>b\n```
['Math', 'String', 'Greedy', 'Game Theory', 'Python3']