#435
Non-overlapping Intervals
specialist · 760 · lc medium +31 · verified · 56.8% accepted · 9,090 likes · top 52%
Description
You are given an array intervals where intervals[i] = [starti, endi]. Return the minimum number of intervals to remove so that all remaining intervals are pairwise non-overlapping. Two intervals that share only a single endpoint (e.g., [1,2] and [2,3]) count as non-overlapping.
Example 1:
Input: intervals = [[1,2],[2,3],[3,4],[1,3]]
Output: 1
Explanation: [1,3] can be removed and the rest of the intervals are non-overlapping.
Example 2:
Input: intervals = [[1,2],[1,2],[1,2]]
Output: 2
Explanation: You need to remove two [1,2] to make the rest of the intervals non-overlapping.
Example 3:
Input: intervals = [[1,2],[2,3]]
Output: 0
Explanation: You don't need to remove any of the intervals since they're already non-overlapping.
Code
1
2
3