Given a string s and an integer k, reverse the first k characters for every consecutive block of 2k characters in s.

If there are fewer than k characters left, reverse all of them. If there are at least k characters but fewer than 2k characters left, reverse the first k characters and leave the remaining characters as they are.

Return the resulting string.

Note: The input string contains only lowercase English letters.

Constraints:

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

• s consists of only lowercase English letters.

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

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.