Description
Given an array intervals where intervals[i] = [li, ri] represent the interval [li, ri), remove all intervals that are covered by another interval in the list.
The interval [a, b) is covered by the interval [c, d) if and only if c <= a and b <= d.
Return the number of remaining intervals.
Example 1:
Input: intervals = [[1,4],[3,6],[2,8]] Output: 2 Explanation: Interval [3,6] is covered by [2,8], therefore it is removed.
Example 2:
Input: intervals = [[1,4],[2,3]] Output: 1
Constraints:
1 <= intervals.length <= 1000intervals[i].length == 20 <= li < ri <= 105- All the given intervals are unique.
Solutions
Code cleanup, not enough tests to accurately measure performance.
Language: javascript(2026-07-06 07:49)DONE
CPU Performance29.79%
Memory Performance36.17%
/**
* @param {number[][]} intervals
* @return {number}
*/
var removeCoveredIntervals = function(intervals) {
intervals.sort((a, b) => a[0] === b[0] ? b[1] - a[1] : a[0] - b[0]);
let maxEnd = -Infinity;
let res = 0;
for (const interval of intervals) {
if (interval[1] > maxEnd) {
maxEnd = interval[1];
res++;
}
}
return res;
};