Leetcode 761. Special Binary String

Given a special binary string (balanced and every prefix has at least as many 1s as 0s), the task is to repeatedly swap adjacent special substrings to produce the lexicographically largest result — which requires recognizing the nested "balanced" structure and using a recursive divide-and-conquer approach that maximizes each primitive special substring and sorts/reorders them to form the largest concatenation.