Available question text
For each character, determine the smallest substring that contains all occurrences of that character (and thus any characters inside it), producing candidate intervals; then choose the maximum number of non-overlapping intervals (breaking ties by minimum total length) — an interval construction plus interval-scheduling/greedy selection problem.
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 1520. Maximum Number of Non-Overlapping Substrings
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source