<filename>30_day_leetcoding_challenge/2020_11/03-Consecutive_Characters.py
class Solution:
    def maxPower(self, s: str) -> int:
        power = []
        
        i, temp = 1, ""
        for s_char in s:
            if s_char == temp:
                i += 1
            else:
                power.append( i )
                i = 1
            temp = s_char
        power.append(i)

        return max(power)

<filename>30_day_leetcoding_challenge/2020_11/03-Consecutive_Characters.py
class Solution:
    def maxPower(self, s: str) -> int:
        power = []
        
        i, temp = 1, ""
        for s_char in s:
            if s_char == temp:
                i += 1
            else:
                power.append( i )
                i = 1
            temp = s_char
        power.append(i)

        return max(power)
