Skip to content

Instantly share code, notes, and snippets.

@kuntalchandra
Created October 4, 2020 09:08
Show Gist options
  • Select an option

  • Save kuntalchandra/c7c94cfe099313670e5a5b5bd9504ab2 to your computer and use it in GitHub Desktop.

Select an option

Save kuntalchandra/c7c94cfe099313670e5a5b5bd9504ab2 to your computer and use it in GitHub Desktop.
Remove Covered Intervals
"""
Given a list of intervals, remove all intervals that are covered by another
interval in the list.
Interval [a,b) is covered by interval [c,d) if and only if c <= a and b <= d.
After doing so, 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
Example 3:
Input: intervals = [[0,10],[5,12]]
Output: 2
Example 4:
Input: intervals = [[3,10],[4,10],[5,11]]
Output: 2
Example 5:
Input: intervals = [[1,2],[1,4],[3,4]]
Output: 1
"""
from typing import List
class Solution:
def removeCoveredIntervals(self, intervals: List[List[int]]) -> int:
intervals.sort(key=lambda x: (x[0], -x[1]))
prev_end = count = 0
for _, end in intervals:
if end > prev_end:
count += 1
prev_end = end
return count
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment