Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input.
Asked at 45 companies
AdobeAlibabaAmazon
Hints
1.Think about what data structure fits Merge Intervals
2.Consider the brute force complexity and how to optimize