[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. [Explanation] There are given arrays. Some arrays have overlapping intervals with other arrays. In that case, overlapping arrays can represent as one. For example, there are [1, 3] and [2, 6]. T..
