Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 1520. Maximum Number of Non-Overlapping Substrings
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.