Fewest intervals to remove
Mediumgreedyintervalssorting
Return the fewest intervals to remove so the rest don't overlap. Intervals that only touch ([1,2] and [2,3]) do not overlap.
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
Constraints
- 1 ≤ intervals.length ≤ 10⁵
- -5·10⁴ ≤ start < end ≤ 5·10⁴
Submit checks your solution against 8 tests, including hidden ones.
/**
* @param {int[][]} intervals
* @return {int}
*/
function eraseOverlapIntervals(intervals) {
}