You are given a string s of length n consisting only of the characters 'A' and 'B', along with a $2 D$ integer array queries.

There are two types of queries:

• [1, j]: Flip the character s[j]. If s[j] is 'A', it becomes 'B', and if s[j] is 'B', it becomes 'A'.

• [2, l, r]: Determine the minimum number of character deletions required to make the substring s[l..r] alternating.

A string is defined as alternating if no two adjacent characters are equal.

Return an integer array containing the results of all type $2$ queries in the order they appear.

Constraints:

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

• s[i] is either 'A' or 'B'.

• $1 \leq q ==$ queries.length $\leq 10^5$

• queries[i].length is equal to $2$ or $3$.

• queries[i] is either of the form [1, j] or [2, l, r].

• $0 \leq j \leq n - 1$

• $0 \leq l \leq r \leq n - 1$

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.