Practice
Resources
Contests
Online IDE
New
Free Mock
Events New Scaler
Practice
Improve your coding skills with our resources
Contests
Compete in popular contests with top coders
Events
Attend free live masterclass hosted by top tech professionals
New
Scaler
Explore Offerings by SCALER

# Binary String Cleanup Challenge

Problem Description

Ryan was tidying up his house for the party when he stumbled upon a messy string hidden under the carpets. Eager to clean it up in a precise and stylish manner, he decided to make it as clean as possible using a specific set of moves.

The string, denoted as s, is a binary string of length n, consisting solely of 0s and 1s. Ryan can perform a move by selecting two consecutive characters si and si+1. If si is 1 and si+1 is 0, he can erase exactly one of them. The string shrinks after each erasure.

Ryan can make an arbitrary number of moves (possibly zero) and aims to create the cleanest possible string. He defines cleanliness such that for two different strings x and y, the shorter string is considered cleaner. If the lengths are the same, the lexicographically smaller string is cleaner.

Your task is to print the cleanest possible string that Ryan can obtain by performing some number of moves.

Problem Constraints
1 =< n <= 105

Input Format
The first argument is the string.

Output Format
Return the cleanest string Ryan can achieve after performing some number of moves (possibly zero).

Example Input
Input 1:
`100001111111`
Input 2:
`40101`

Example Output
Output 1:
`0001111111`
Output 2:
`001`

Example Explanation
For Input 1:
`Ryan can't perform any moves.`

For Input 2:
`Ryan should erase s2.`

NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a question? Checkout Sample Codes for more details.
Hints
• Hint 1
• Solution Approach
• Complete Solution

## Discussion

Free Mock Assessment
Fill up the details for personalised experience.
Phone Number *
OTP will be sent to this number for verification
+1 *
+1
Change Number
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
*Enter the expected year of graduation if you're student
Current Employer
Company Name
College/University Name
Job Title
Job Title
Software Development Engineer (Backend)
Software Development Engineer (Frontend)
Software Development Engineer (Full Stack)
Data Scientist
Android Engineer
iOS Engineer
Devops Engineer
Support Engineer
Research Engineer
Engineering Intern
QA Engineer
Co-founder
SDET
Product Manager
Product Designer
Backend Architect
Program Manager
Release Engineer