Lexicographically smallest string formed repeatedly deleting character from substring 10
Given a binary string S of length N, the task is to find lexicographically the smallest string formed after modifying the string by selecting any substring “10” and removing any one of the characters from that substring, any number of times.
Input: S = “0101”
Removing the S(=1) from the substring, “10” over the range [1, 2] modifies the string S to “001”, which is the smallest.
Input: S =”11001101″
One possible way to obtain Lexicographically the smallest string is:
- Removing the S(=1) from the substring, “10” over the range [1, 2] modifies the string S as S = “1001101”.
- Removing the S(=1) from the substring, “10” over the range [0, 1] modifies the string S as S = “001101”.
- Removing the S(=1) from the substring, “10” over the range [3, 4] modifies the string S as S = “00101”.
- Removing the S(=1) from the substring, “10” over the range [2, 3] modifies the string S as S = “0001”.
- Now any character can not be removed.
Therefore, the lexicographically smallest obtained string is “0001”.
Approach: The given problem can be solved based on the following observations:
- It can be observed that the character ‘1‘ after the last zero can not be removed as one will not be able to find any “10” substring.
- Lexicographically, the smallest string will contain as much as zero as it can before the first one.
- It can be observed that every ‘1‘ can be deleted if there is at least one ‘0‘ after it.
- Therefore, the idea is to remove all the ones before the last occurring ‘0‘ from the string.
Follow the steps below to solve the problem:
- Initialize two variables, say ans and LastZe, to store the resulting string and the index of last occurring ‘0‘.
- Iterate over the characters of string S using the variable i and then if S[i] is ‘0‘ then assign i to LastZe.
- Iterate over the characters of string S using the variable i and perform the following operations:
- If S[i] = ‘0’ and i ≤ LastZe, then append S[i] to ans.
- Otherwise, if i > LastZe, then append S[i] to ans.
- Finally, after completing the above steps, print the result as ans.
Below is the implementation of the above approach:
Time Complexity: O(N)
Auxiliary Space: O(1)
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course.