You are given a string s and an integer k.

Two identical characters at indices i and j (where i $<$ j) are considered close if $j - i \leq k$.

While there exists a pair of close characters, merge them by eliminating the character at index j. Repeat this process until no two identical characters are at a distance of at most k.

Return the final string after all possible merges have been made.

Constraints:

• $1 \leq$ s.length $\leq 100$

• $1 \leq$ k $\leq$ s.length

• s consists of 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.