Practice Remove Covered 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 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.
Source: Remove Covered Intervals on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
intervals = [[1,4],[3,6],[2,8]]
Output
2
# Example 2
Input
intervals = [[1,4],[2,3]]
Output
1
Constraints
1 <= intervals.length <= 1000
intervals[i].length == 2
0 <= li < ri <= 10^5
All the given intervals are unique.
Related LeetCode Problems
Practice more problems similar to Remove Covered Intervals.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.