You are given two lists of closed intervals, firstList and secondList, where firstList[i] = [start_i, end_i] and secondList[j] = [start_j, end_j]. Each list of intervals is pairwise disjoint and in sorted order.
Return the intersection of these two interval lists.
A closed interval [a, b] (with a <= b) denotes the set of real numbers x with a <= x <= b.
The intersection of two closed intervals is a set of real numbers that are either empty or represented as a closed interval.
Key insight: Use two pointers, one for each list. For the current pair:
Real-world analogy: Finding overlapping availability between two people's schedules.
firstList = [[0,2],[5,10],[13,23],[24,25]], secondList = [[1,5],[8,12],[15,24],[25,26]][[1,2],[5,5],[8,10],[15,23],[24,24],[25,25]]firstList = [[1,3],[5,9]], secondList = [][]firstList = [], secondList = [[4,8],[10,12]][]0 <= firstList.length, secondList.length <= 1000firstList.length + secondList.length >= 10 <= start_i < end_i <= 10^90 <= start_j < end_j <= 10^9Each list is pairwise disjoint and in sorted orderClick "Run" to execute your code against test cases
Socratic guidance - I'll ask questions, not give answers