Given a string s and an integer k, a k-duplicate removal involves selecting k adjacent and equal characters from s and removing them, after which the left and right portions of the string are joined together.

Perform k-duplicate removals on s repeatedly until no more can be made.

Return the final string after all such removals. The answer is guaranteed to be unique.

Constraints:

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

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

• s contains only lowercase English letters

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.