python 3 || clean || easy approach
The trick here is that the answer string will contain only one 0 and that zero will be at the cth position (where c is the no of zeroes in the initial string).T
The trick here is that the answer string will contain only **one 0** and that zero will be at the **cth position** (where **c** is the **no of zeroes** in the initial string).The **rest** of the string will be filled with **1s.**\n```\nlass Solution:\n    def maximumBinaryString(self, s: str) -> str:\n        #count of 0\n        c=0\n        #final ans string will contain only one zero.therefore shift the first 0  to c places.Initialize ans string with all 1s\n        lst=["1"]*len(s)\n        for i in range (0,len(s)):\n            if s[i]=="0":\n                c+=1\n        for i in range (0,len(s)):\n\t\t#finding the ist 0\n            if s[i]=="0":\n                lst[i+c-1]="0"\n                return "".join(lst)\n        return s\n  \n```\nif you like my solution **please upvote** me
['Python', 'Python3']