✔️ [Python3] SIMPLE, Explained
Simply iterate over characters of the string and keep track of the repeating letters. The maximum is our result.\n\nTime: O(n)\nSpase: O(1)\n\nRuntime: 32 ms, f
Simply iterate over characters of the string and keep track of the repeating letters. The maximum is our result.\n\nTime: **O(n)**\nSpase: **O(1)**\n\nRuntime: 32 ms, faster than **98.04%** of Python3 online submissions for Consecutive Characters.\nMemory Usage: 14 MB, less than **98.64%** of Python3 online submissions for Consecutive Characters.\n\n```\nclass Solution:\n    def maxPower(self, s: str) -> int:\n        res = 1\n        \n        p = 1\n        prev = None\n        \n        for ch in s:\n            if ch != prev:\n                prev = ch\n                p = 1\n            else:\n                p += 1\n\n            res = max(res, p)\n            \n        return res\n```
['Python3']