Solution: Interval List Intersections
Explore how to compute the intersection of two sorted interval lists by using a two-pointer technique that compares interval endpoints. Understand the conditions for overlapping intervals and how to efficiently traverse both lists to build the list of intersections, optimizing time complexity to linear order.
We'll cover the following...
Statement
Given two lists of intervalLista and intervalListb, 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:
intervalLista[i] = [starti, endi]intervalListb[j] = [startj, endj]
The intersection of two closed intervals i and j is either:
An empty set, if they do not overlap, or
A closed interval
[max(starti, startj), min(endi, endj)]if they do overlap.
Also, each list of intervals is pairwise disjoint and in sorted order.
Constraints:
...