Given an integer array nums and an integer k, find the lexicographically smallest permutation of nums such that the number formed by concatenating the elements in that order is divisible by k.

Return the lexicographically smallest permutation as an array of integers. If no permutation produces a concatenated number divisible by k, return an empty array.

Constraints:

• $1 \leq$ nums.length $\leq 13$

• $1 \leq$ nums[i] $\leq 10^5$

• $1 \leq$ k $\leq 100$

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.