Good Binary Strings

Problem Overview

• Given a good binary string (equal 0s and 1s; every prefix has at least as many 1s as 0s), swap adjacent good substrings to form the largest numeric value that remains good.
• Input: String binString; Output: the largest possible good binary string.
• Domain: binary string manipulation with prefix constraints and substring adjacency rules.
• This coding interview problem is an interview question from Bnp interviews.