Consecutive Characters — LeetCode 1446 Python Solution

The problem

The power of the string is the maximum length of a non-empty substring that contains only one unique character. Given a string s, return the power of s.

Example

Input

s = "leetcode"

Output

2

Explanation

The substring "ee" is of length 2 with the character 'e' only.

Python solution

class Solution:
    def maxPower(self, s: str) -> int:
        ans = t = 1
        for a, b in pairwise(s):
            if a == b:
                t += 1
                ans = max(ans, t)
            else:
                t = 1
        return ans

Complexity

Pattern: Hash Map

Trade memory for time: remember what you have seen so the second pass never happens. LeetCode 1446. Consecutive Characters is filed here because the reference solution below belongs to the algorithm family this hub collects, even though its LeetCode tags point elsewhere.

The hash map guide has the Python template for the pattern and the 709 LeetCode problems that use it.

Related problems