Insert Interval
Insert a new interval into a sorted list of non-overlapping intervals, merging where necessary.
Progress cannot be saved in this browser, so completed lessons will reset when you leave.
Lesson notes
Try it before you watch
Restate the problem in your own words, list the edge cases, and sketch a solution with its running time. Then play the video and compare.
Reveal the key idea
In one pass, copy intervals that end before the new one, merge every interval that overlaps it, then copy the rest.
Pattern: Greedy & intervals. Make the locally best choice, usually after sorting, and argue why it never hurts later.
Complexity
| Measure | Bound |
|---|---|
| Time | O(n) |
| Extra space | O(n) for the output |
Walkthroughs often start from a simpler approach first; aim to reach these bounds. New to Big-O? Read understanding algorithmic complexity.