Python easy solution. Memory: less than 100.00% .faster than 89.00% of Python3 online submissions
\tclass Solution:\n\t\tdef maxPower(self, s: str) -> int:\n\t\t\tif not s:\n\t\t\t\treturn 0\n\t\t\tpower = [0] * len(s)\n\t\t\tprev = s[0]\n\t\t\tpower[0] = 1\
\tclass Solution:\n\t\tdef maxPower(self, s: str) -> int:\n\t\t\tif not s:\n\t\t\t\treturn 0\n\t\t\tpower = [0] * len(s)\n\t\t\tprev = s[0]\n\t\t\tpower[0] = 1\n\t\t\tfor index, char in enumerate(s[1:], 1):\n\t\t\t\tif prev == char:\n\t\t\t\t\tpower[index] = power[index - 1] + 1\n\t\t\t\telse:\n\t\t\t\t\tpower[index] = 1\n\t\t\t\tprev = char\n        \n\t\t\treturn max(power)
['Python3']