Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in C++

Solution: Insert Interval

Explore how to insert a new interval into an existing sorted list of non-overlapping intervals. Learn to identify overlaps and merge intervals efficiently using a linear scan approach that avoids extra sorting. Understand the step-by-step merging process and analyze the time and space complexity of this optimized solution.

We'll cover the following...

Statement

You are given a list of non-overlapping intervals, intervals, where each interval is represented as [starti, endi] and the list is sorted in ascending order by the start of each interval (starti). 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:

    ...