You are given a string answerKey, where each character represents an answer to a question as either 'T' or 'F'. You are also given an integer k.

In a single operation, you can change the character at any position of answerKey to either 'T' or 'F'.

Return the maximum length of a substring containing consecutive identical characters in answerKey after performing at most k operations.

Constraints:

• n $==$ answerKey.length

• $1 \leq$ n $\leq 5 imes 10^4$

• answerKey[i] is either 'T' or 'F'

• $1 \leq$ k $\leq$ n

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.