Leetcode Problem 1288. Remove Covered Intervals

1288. Remove Covered Intervals

Leetcode Solutions

Sort the intervals in ascending order by their start point.
If two intervals have the same start point, sort them by descending order of their end point so that the longer interval comes first.
Initialize a variable count to 0 to keep track of the number of non-covered intervals.
Iterate over the sorted intervals, and for each interval: a. If the current interval is not covered by the previous one (i.e., its end point is greater than the end point of the previous interval), increment count and update the previous interval to the current one. b. If the current interval is covered by the previous one, continue to the next interval without incrementing count.
Return the value of count.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen