Given a string, find lexicographically next string.
Input : geeks Output : geekt The last character 's' is changed to 't'. Input : raavz Output : raawz Since we can't increase last character, we increment previous character. Input : zzz Output : zzza
If string is empty, we return ‘a’. If string contains all characters as ‘z’, we append ‘a’ at the end. Otherwise we find first character from end which is not z and increment it.
This article is contributed by Pawan Asipu. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
- 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
- Lexicographically smallest string whose hamming distance from given string is exactly K
- Lexicographically middle string
- Lexicographically first palindromic string
- Lexicographically n-th permutation of a string
- Lexicographically largest sub-sequence of the given string
- Lexicographically smallest string of length N and sum K
- Find n-th lexicographically permutation of a string | Set 2
- Lexicographically minimum string rotation | Set 1
- Lexicographically next greater string using same character set
- Queries to answer the X-th smallest sub-string lexicographically
- Lexicographically first alternate vowel and consonant string
- Lexicographically smallest permutation of a string with given subsequences
- K-th lexicographically smallest unique substring of a given string