Merge Overlapping Intervals

Problem

Given an array of intervals intervals, where each interval is a pair [start, end], merge all overlapping intervals and return a new array of non-overlapping intervals that covers the same ranges. The output may be returned in any order, but an efficient solution should exploit sorting.

Constraints

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