Problem Description
Given a set of non-overlapping intervals and a new interval.
Insert the new interval into the set of intervals (merge if necessary).
You may assume that the intervals were initially sorted according to their start times.
Note: Make sure the returned intervals are also sorted.
Intervals = [[1,3],[6,9]] newInterval = [2,5]Input 2:
Intervals = [[1,2],[3,5],[6,7],[8,10],[12,16]] newInterval = [4,9]
[[1,5],[6,9]]Output 2:
[1,2],[3,10],[12,16]
Given intervals [1,3],[6,9] insert and merge [2,5] would result in [1,5],[6,9].Explanation 2:
Given [1,2],[3,5],[6,7],[8,10],[12,16], insert and merge [4,9] would result in [1,2],[3,10],[12,16]. This is because the new interval [4,9] overlaps with [3,5],[6,7],[8,10].
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a question? Checkout Sample Codes for more details.
1 Million +
Strong Tech Community500 +
Questions to Practice100 +
Expert Interview Guides
