Merge Intervals

#56
Medium
Intervals
O(n log n)
O(n)
Facebook
Amazon
Microsoft
Google
Bloomberg
View on LeetCode

Problem Description

Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals.