Insert Interval

Understand how to insert a new interval into a sorted list of non-overlapping intervals. Learn to handle overlapping intervals by merging them properly, ensuring the final list remains sorted without overlaps. Practice implementing this solution in C++ to prepare for interval-based coding interview problems.

We'll cover the following...

Statement
Examples
Understand the problem
Figure it out
Try it yourself

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, newInterval = [start, end].

Your task is to insert newInterval into the list of intervals such that the list remains sorted by starting times and still contains no overlapping intervalsOverlapping intervals are two or more intervals with at least one common point in time.. If any intervals overlap after the insertion, merge them accordingly.

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: