#1163

Last Substring in Lexicographical Order

hard · verified · 35% accepted · 664 likes · top 13%

two pointers · string

⊣ practice⊣ open on leetcode ↗

Description

Given a string s, return the last substring of s in lexicographical order.

Example 1:

Input: s = "abab"
Output: "bab"
Explanation: The substrings are ["a", "ab", "aba", "abab", "b", "ba", "bab"]. The lexicographically maximum substring is "bab".

Example 2:

Input: s = "leetcode"
Output: "tcode"

Solution