Given an array of intervals where intervals[i] = [start, end],
merge all overlapping intervals and return an array of the non-overlapping
intervals that cover all the intervals in the input.
Input: [[1,3],[2,6],[8,10],[15,18]] Output: [[1,6],[8,10],[15,18]]
Input: [[1,4],[4,5]] Output: [[1,5]]
Input: [[1,4],[0,4]] Output: [[0,4]]
Your program must print the merged intervals as a JSON array.
No submissions yet.
Discuss sorting intervals, greedy merging, and edge cases.