Given a string s and an integer k, rearrange s such that identical characters are separated by a distance of at least k from each other.

If it is impossible to rearrange the string to satisfy this condition, return an empty string "".

Constraints:

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

• s consists of only lowercase English letters.

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

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.