Insert Interval
Try to solve the Insert Interval problem.
We'll cover the following...
Statement
You are given a list of non-overlapping intervals, intervals
, where each interval is represented as [start
i
, end
i
]
and the list is sorted in ascending order by the start of each interval (start
i
). You are also given another interval, new_interval = [start, end]
.
Your task is to insert new_interval
into the list of intervals such that the list remains sorted by starting times and still contains no
Return the updated list of intervals.
Note: You don’t need to modify
intervals
in place. You can make a new array and return it.
Constraints:
...