Merge intervals in Swift like a Pro — Interval List Intersections (Leetcode 986) -
Difficulty: Link: Leetcode 986 You are given two lists of closed intervals, firstList and secondList, where…theswiftnerd.com You can read the full story on The Swift Nerd blog along with other interesting ones. Problem Statement You are given two lists of closed intervals, firstList and secondList, where firstList[i] = [starti, endi] and secondList[j] = [startj, endj]. Each list of intervals is pairwise disjoint and in sorted order.