The set containing integers from $1$ to n has a total of $n!$ unique permutations.

By listing and ordering all of these permutations in lexicographical order, an ordered sequence of permutations is formed.

Given two integers n and k, return the $k^{ ext{th}}$ permutation sequence as a string.

Constraints:

• $1 \leq$ n $\leq 9$

• $1 \leq$ k $\leq n!$

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.