Practice Non-overlapping Intervals
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
Given an array of intervals intervals where intervals[i] = [starti, endi], return the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping. Note that intervals which only touch at a point are non-overlapping. For example, [1, 2] and [2, 3] are non-overlapping.
Source: Non-overlapping Intervals on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
intervals = [[1,2],[2,3],[3,4],[1,3]]
Output
1
# Example 2
Input
intervals = [[1,2],[1,2],[1,2]]
Output
2
# Example 3
Input
intervals = [[1,2],[2,3]]
Output
0
Constraints
1 <= intervals.length <= 10^5
intervals[i].length == 2
-5 * 10^4 <= start_i < end_i <= 5 * 10^4
Related LeetCode Problems
Practice more problems similar to Non-overlapping Intervals.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.