Python 3 beats 93% of Python Users !!!
\n\nclass Solution:\n    def maxPower(self, s: str) -> int:\n        out=[]\n        count=0\n        for i in range(len(s)-1):\n            if s[i] == s[i+1]:\
![image](https://assets.leetcode.com/users/images/e77d46dc-1431-45c2-bcd5-50a74ba709c4_1597725929.5576763.png)\n```\nclass Solution:\n    def maxPower(self, s: str) -> int:\n        out=[]\n        count=0\n        for i in range(len(s)-1):\n            if s[i] == s[i+1]:\n                count+=1\n                out.append(count)\n            else:\n                count=0\n        if out ==[]:\n            return 1\n        return max(out)+1\n```
['Python3']