LeetCode içerisinde bulunan “Consecutive Characters” sorusunun açıklaması ve çözümü. Bu soruda sizi verilen bir string içerisinde, yan yana olan aynı karakterlerin maksimum sayısını bulmanız isteniyor.

► LeetCode 1446. Consecutive Characters: https://leetcode.com/problems/consecutive-characters/

► Problem açıklaması:

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 1:

Input: s = “leetcode”

Output: 2

Explanation: The substring “ee” is of length 2 with the character ‘e’ only.

Example 2:

Input: s = “abbcccddddeeeeedcba”

Output: 5

Explanation: The substring “eeeee” is of length 5 with the character ‘e’ only.

Example 3:

Input: s = “triplepillooooow”

Output: 5

Example 4:

Input: s = “hooraaaaaaaaaaay”

Output: 11

Example 5:

Input: s = “tourist”

Output: 1

Constraints:

1 <= s.length <= 500

s consists of only lowercase English letters.