Given an array of intervals, merge all overlapping intervals.
Input: intervals = [[1,3],[2,6],[8,10],[15,18]]
Output: [[1,6],[8,10],[15,18]]
Topics: arrays, sorting
Asked by: Amazon, Meta, Google
Time complexity: O(n log n). Space complexity: O(n).