1272. Remove Interval

Problem

Given a sorted list of disjoint intervals and a removal interval, return the list after removing all numbers in the removal interval.

Given a collection of disjoint (non-overlapping) intervals sorted by start time, and an interval [toRemove[0], toRemove[1]] to remove, return the list of remaining intervals after removing all numbers covered by the removal interval.

The intervals are disjoint, meaning no two intervals overlap.

Examples
Input: [[[0,2],[3,4],[5,7]],[1,6]]
Output: [[0,1],[6,7]]
Hints
Related Problems

1272. Remove Interval

Given a sorted list of disjoint intervals and a removal interval, return the list after removing all numbers in the removal interval.