Merge Overlapping Time Intervals

Problem

Given an array of intervals intervals, where each interval is a two-element array [start, end] and start <= end, merge all overlapping intervals and return a new array of non-overlapping intervals covering the same ranges. The output may be returned in sorted order by start time.

Constraints

• 1 <= len(intervals) <= 10^4
• intervals[i].length == 2
• 0 <= start <= end <= 10^6
• Intervals may appear in any order