Insert Interval
Try to solve the Insert Interval problem.
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:
intervals.length
intervals[i].length
,new_interval.length
start
i
end
i
The list of intervals is sorted in ascending order based on the start time.
Examples
Understand the problem
Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps us to check if you’re solving the correct problem:
Insert Interval
What will be the updated list of intervals?
existing_intervals =
new_interval =
Figure it out
We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.
Try it yourself
Implement your solution in the following coding playground.
def insert_interval(existing_intervals, new_interval):# Replace this placeholder return statement with your codereturn []