Available question text
Return the lexicographically largest substring of s, i.e., the maximum among all suffixes and substrings starting at any index. Because n can be large (≤4·10^5), the challenge is to pick the maximal starting position efficiently (linear-time suffix comparison / Booth-style two-pointer approach) rather than enumerating all substrings.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1163. Last Substring in Lexicographical Order
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source