Non-overlapping Intervals
Updated Feb 24, 2026
Problem
Return minimum intervals to remove to eliminate overlaps.
Constraints
1 <= intervals.length <= 10^5
Examples
Example 1
Input:
{"intervals": [[1, 2], [2, 3], [3, 4], [1, 3]]}
Output:
1
Function Signature
def eraseOverlapIntervals(self, intervals: list[list[int]]) -> int
How to Submit
Implement a Solution class with a eraseOverlapIntervals method.
Your method will be called with the input parameters and should return the answer.