You are given a string num representing a large integer, and an integer k.

A wonderful integer is defined as a permutation of the digits in num that is strictly greater in value than num.

Return the minimum number of adjacent digit swaps needed to transform num into the $k^{ ext{th}}$ smallest wonderful integer.

Note: The test cases are generated such that the $k^{ ext{th}}$ smallest wonderful integer always exists.

Constraints:

• $2 \leq$ num.length $\leq 1000$

• $1 \leq$ k $\leq 1000$

• num consists only of digits.

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.