Given a palindromic string s and an integer k, return the $k^{ ext{th}}$ lexicographically smallest palindromic rearrangement of s. If there are fewer than k distinct palindromic rearrangements, return an empty string "".

Constraints:

• $1 \leq$ s.length $\leq 10^4$

• s consists of lowercase English letters.

• s is guaranteed to be palindromic.

• $1 \leq$ k $\leq 10^6$

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.