Skip to content

Practice Longest Substring of One Repeating Character

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Hard#2213
LeetCode Problem

Longest Substring of One Repeating Character

Problem Statement

You are given a 0-indexed string s. You are also given a 0-indexed string queryCharacters of length k and a 0-indexed array of integer indices queryIndices of length k, both of which are used to describe k queries. The ith query updates the character in s at index queryIndices[i] to the character queryCharacters[i]. Return an array lengths of length k where lengths[i] is the length of the longest substring of s consisting of only one repeating character after the ith query is performed.

Source: Longest Substring of One Repeating Character on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
s = "babacc", queryCharacters = "bcb", queryIndices = [1,3,3]
Output
[3,3,4]

# Example 2

Input
s = "abyzz", queryCharacters = "aa", queryIndices = [2,1]
Output
[2,3]

Constraints

1 <= s.length <= 10^5
s consists of lowercase English letters.
k == queryCharacters.length == queryIndices.length
1 <= k <= 10^5
queryCharacters consists of lowercase English letters.
0 <= queryIndices[i] < s.length

Related LeetCode Problems

Practice more problems similar to Longest Substring of One Repeating Character.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.