Lexicographically Minimum String After Removing Stars
Medium
You receive a string s. It may contain any number of '*' characters. Your task is to remove all '*' characters.
While there is a '*', do the following operation:
- Delete the leftmost
'*'and the smallest non-'*'character to its left. If there are several smallest characters, you can delete any of them.
Produce the lexicographically smallest resulting string after removing all '*' characters.
Example 1
Input: s = "aaba*"
Output: "aab"
Explanation: We should delete one of the 'a' characters with '*'. If we choose s[3], s becomes the lexicographically smallest.
Example 2
Input: s = "abc"
Output: "abc"
Explanation: There is no '*' in the string. notionvc: ff07e34f-b1d6-41fb-9f83-5d0ba3c1ecde
Constraints
1 <= s.length <= 10^5sconsists only of lowercase English letters and'*'.- The input is generated such that it is possible to delete all
'*'characters.
Did this problem appear in one of your interviews?
Responses stay private.