Leetcode 986. Interval List Intersections

Given two sorted, pairwise-disjoint lists of closed intervals, return all non-empty intersections between intervals from the two lists. Because each list is ordered and non-overlapping, the overlaps can be produced by scanning both lists simultaneously in linear time.