Given a string str, the task is to find the lexicographically smallest string that can be formed by removing at most one character from the given string.
Input: str = "abcda" Output: abca One can remove 'd' to get "abca" which is the lexicographically smallest string possible. Input: str = "aaa' Output: aa
Approach: Traverse the string and delete the i-th character at the first point where s[i]>s[i+1]. If in case there is no such character then delete the last character in the string.
Below is the implementation of the above approach:
- Lexicographically smallest string formed by appending a character from the first K characters of a given string
- Lexicographically smallest string formed by appending a character from first K characters of a string | Set 2
- Make the string lexicographically smallest and non palindromic by replacing exactly one character
- Find the lexicographically smallest sequence which can be formed by re-arranging elements of second array
- Find a string such that every character is lexicographically greater than its immediate next character
- Lexicographically largest string formed from the characters in range L and R
- Lexicographically next greater string using same character set
- Lexicographically smallest string whose hamming distance from given string is exactly K
- Find longest palindrome formed by removing or shuffling chars from string
- Lexicographically smallest string of length N and sum K
- Character replacement after removing duplicates from a string
- Lexicographically smaller string by swapping at most one character pair
- Lexicographically smallest permutation of a string with given subsequences
- Find lexicographically smallest string in at most one swaps
- Queries to answer the X-th smallest sub-string lexicographically
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.