Skip to content
This repository was archived by the owner on Sep 22, 2021. It is now read-only.
This repository was archived by the owner on Sep 22, 2021. It is now read-only.

1446 - Consecutive Characters #673

@Vinit-Dantkale

Description

@Vinit-Dantkale

Description of the Problem

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

Return the power of the string.

Code

class Solution: def maxPower(self, s: str) -> int: 

Link To The LeetCode Problem

LeetCode

Metadata

Metadata

Assignees

No one assigned

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions