![image](https://assets.leetcode.com/users/images/495ad6d3-1bca-4aa8-a53e-ed18c611f575_1655636327.630384.png)\n**Constraint : String only has \'0\' and \'1\'**\n\n\nCould only think of bruteforce where we can find all permuation of the string by counting the 0 and 1 and checking for each ,if on perfoming the given operation we get the lexicographically maximum strijng.\nCould only pass 6 test cases\n\n*What can be the best approch?*\n

\nConstraint : String only has \'0\' and \'1\'\n\n\nCould only think of bruteforce where we can find all permuation of the string by counting the 0 and 1 and ch