1
# Runtime: 159 ms (Top 46.41%) | Memory: 14.4 MB (Top 92.31%)
2
class Solution:
3
    def removeCoveredIntervals(self, intervals: List[List[int]]) -> int:
4

5
        intervals.sort(key=lambda x: (x[0], -x[1]))
6
        current, count = intervals[0], 1
7
        for i in range(1, len(intervals)):
8
            if current[0] <= intervals[i][0] and intervals[i][1] <= current[1]:
9
                continue
10
            current = intervals[i]
11
            count += 1
12
        return count
13

14

15
# time and space complexity
16
# time: O(nlog(n))
17
# space: O(1)