Interval List Intersections
Try to solve the Interval List Intersections problem.
We'll cover the following...
Statement
Given two lists of interval_list_a
and interval_list_b
, return the intersection of the two interval lists.
Each interval in the lists has its own start and end time and is represented as [start, end]
. Specifically:
interval_list_a[i] = [start
i
, end
i
]
interval_list_b[j] = [start
j
, end
j
]
The intersection of two closed intervals i
and j
is either:
An empty set, if they do not overlap, or
A closed interval
[max(start
i
, start
j
), min(end
i
, end
j
)]
if they do overlap.
Also, each list of intervals is pairwise disjoint and in sorted order.
Constraints:
...