There is a safe protected by a password consisting of a sequence of n digits, where each digit is chosen from the first k digits from $0$ to $k - 1$.

The safe keypad tracks the most recently entered digits. Entering a new digit causes the safe to check the last n entered digits. If this sequence matches the password, the safe unlocks.

Return any string of the minimum possible length that is guaranteed to unlock the safe at some point during the sequence of typed digits.

Constraints:

• $1 \leq$ n $\leq 4$

• $1 \leq$ k $\leq 10$

• $1 \leq$ k$^{`n`} \leq 4096$

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.