A special binary string is a binary string satisfying both of the following properties:

• The count of '0's equals the count of '1's.

• Every prefix of the string contains at least as many '1's as '0's.

You are given a special binary string s. A single move consists of selecting two consecutive, non-empty special substrings of s and swapping them. Two substrings are considered consecutive if the last character of the first substring is at exactly one index before the first character of the second substring.

Return the lexicographically largest string achievable after performing any number of such moves on s.

Constraints:

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

• s[i] is either '0' or '1'

• s is guaranteed to be a special binary string

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.