Leetcode 435. Non-overlapping Intervals
Given a list of intervals (endpoints touching allowed), find the minimum number to remove so the remaining intervals are pairwise non-overlapping — equivalently, select the maximum set of non-overlapping intervals (classic interval-scheduling/greedy pattern, n up to 1e5).
Asked at:
DocuSign
Amazon
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Early July, 2026
DocuSign
Senior
Slight variation of LeetCode 435: Non-overlapping intervals. Was asked to return the number of non-overlapping intervals.
Early September, 2025
Amazon
Junior
Late December, 2024
Amazon
Mid-level
Hello Interview Premium
Your account is free and you can post anonymously if you choose.