Example 1:
Input: firstList = [[0,10],[20,30]], secondList = [[5,8],[15,22]]
Output: [[5,8],[20,22]]
Example 2:
Input: firstList = [[0,2],[5,10],[13,23],[24,25]], secondList = [[1,5],[8,12],[15,24],[25,26]]
Output: [[1,2],[5,5],[8,10],[15,23],[24,24],[25,25]]
You are given two lists of closed intervals, firstList and secondList. Each list is sorted by start time, and the intervals within the same list are pairwise disjoint.
Return all intersections between the two lists.
An intersection between [a, b] and [c, d] is [max(a, c), min(b, d)] when max(a, c) <= min(b, d).
Follow-up note: If the lists are too large to fit in memory, keep the same two-pointer logic but read each list as a stream or chunked iterator, buffering only the current interval from each source.
0 <= firstList.length, secondList.length <= 10^5firstList[i].length == secondList[j].length == 20 <= start <= end <= 10^9firstList and secondList are sorted by start timeReported for an Uber software engineer onsite round as a sorted-interval overlap problem, with a follow-up about handling input lists too large to fit in memory.