Leetcode 986. Interval List Intersections [Algo + Code + Time/Space Complexity]

One of the most frequently asked coding interview questions on Arrays in companies like Google, Facebook, Amazon, LinkedIn, Microsoft, Uber, Apple, Adobe, Bloomberg etc.
LeetCode : Interval List Intersections
Problem URL - leetcode.com/p...
Question : Given two lists of closed intervals, each list of intervals is pairwise disjoint and in sorted order.
Return the intersection of these two interval lists.
Example 1:
Input: A = [[0,2],[5,10],[13,23],[24,25]], B = [[1,5],[8,12],[15,24],[25,26]]
Output: [[1,2],[5,5],[8,10],[15,23],[24,24],[25,25]]
Connect with me on LinkedIn at: / jayati-tiwari
#leetcode, #coding, #algorithms, #facebook, #leetcode986, #intervallistintersections, #google, #amazon, #uber, #adobe, #apple