Given a string s consisting of digits, you are permitted to swap at most $1$ pair of adjacent digits provided that both digits share the same parity (both are even or both are odd).

Return the lexicographically smallest string that can be obtained after applying at most $1$ such swap.

Constraints:

• $2 \leq$ s.length $\leq 100$

• s 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.