Solution: Interval List Intersections
Understand how to identify overlapping intervals between two sorted lists using a two-pointer approach. Learn to calculate intersections efficiently by comparing start and end times, advancing pointers based on interval end points, and achieve a solution with linear time complexity.
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:
...