Given a string s we have to find the lexicographical maximum substring of a string
Input : s = "ababaa" Output : babaa Explanation : "babaa" is the maximum lexicographic susbtring formed from this string Input : s = "asdfaa" Output : sdfaa
The idea is simple, we traverse through all substrings. For every substring, we compare it with current result and update result if needed.
Below is the implementation:
We find largest character and all its indexes. Now we simply traverse through all instances of the largest character to find lexicographically maximum substring.
Here we follow the above approach.
GeeksforGeeks has prepared a complete interview preparation course with premium videos, theory, practice problems, TA support and many more features. Please refer Placement 100 for details
- Maximum length substring with highest frequency in a string
- Maximum splits in binary string such that each substring is divisible by given odd number
- K-th lexicographical string of given length
- Lexicographical concatenation of all substrings of a string
- Find if a given string can be represented from a substring by iterating the substring “n” times
- Largest lexicographical string with at most K consecutive elements
- Print all the combinations of a string in lexicographical order
- Find the k-th string in lexicographical order consisting of n-2 X's and 2 Y's
- Partition given string in such manner that i'th substring is sum of (i-1)'th and (i-2)'th substring
- Find length of longest subsequence of one string which is substring of another string
- Queries to check if string B exists as substring in string A
- Minimum changes required to make first string substring of second string
- Check if the given string is shuffled substring of another string
- Maximum length substring having all same characters after k changes
- Find the Substring with maximum product
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 Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.