You are given a $0$ indexed string s. You are also given a string queryCharacters of length k and an integer array queryIndices of length k, which describe k queries.

For each query $i$ from $0$ to $k - 1$:

1. The character at index queryIndices[i] in s is replaced by queryCharacters[i].

2. Compute the length of the longest substring of s that consists of a single repeating character.

Return an integer array of length k, where the value at index $i$ is the length of the longest substring consisting of one repeating character after applying the $i^{ ext{th}}$ query.

Constraints:

• $1 \leq$ s.length $\leq 10^5$

• s consists of lowercase English letters.

• k == queryCharacters.length == queryIndices.length

• $1 \leq$ k $\leq 10^5$

• queryCharacters consists of lowercase English letters.

• $0 \leq$ queryIndices[i] $<$ s.length

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.