You are given a $0$ indexed string blocks of length n, where blocks[i] is either 'W' or 'B', representing the color of the $i$th block. The characters 'W' and 'B' denote the colors white and black, respectively.

You are also given an integer k, which represents the desired number of consecutive black blocks.

In one operation, you can recolor a white block to become a black block.

Return the minimum number of operations required so that there is at least one sequence of k consecutive black blocks.

Constraints:

• n == blocks.length

• $1 \leq$ n $\leq 100$

• blocks[i] is either 'W' or 'B'.

• $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.