Given a string s, return all distinct palindromic permutations that can be formed using its characters. You may return the answers in any order. If no palindromic permutation can be constructed from s, return an empty list.

Constraints:

• $1 \leq$ s.length $\leq 16$

• s consists of only lowercase English letters.

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.