Problem
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. (link)
Example 1:
Input: intervals = [[1,3],[2,6...
