Medium
Quiz
#57 Insert Interval
APPROACH
A sorted, non-overlapping intervals array and a newInterval are given. Insert newInterval, merging any overlapping intervals, so the result remains sorted and non-overlapping. A new array may be returned.
Example 1:
Input: intervals = [[1,3],[6,9]], newInterval = [2,5]
Output: [[1,5],[6,9]]
Example 2:
Input: intervals = [[1,2],[3,5],[6,7],[8,10],[12,16]], newInterval = [4,8]
Output: [[1,2],[3,10],[12,16]]
Explanation: Because the new interval [4,8] overlaps with [3,5],[6,7],[8,10].
1 of 4
1:00
What is the optimal approach for this problem?