Skip to content

Overview Resume Score

Practice

LarpCode Reps LarpTalk

Interview

Templates Sessions

recent

Loading problem

Insert Interval · medium intervals interview problem · Larpy

medium· intervals Mock interview

Insert Interval

Given a list of non-overlapping `intervals` sorted by start, and a `new_interval`, insert it and merge any overlaps. Return the resulting sorted list of non-overlapping intervals.

Figure

shared timeline

Examples

in: intervals = [[1,3],[6,9]], new_interval = [2,5]

out: [[1,5],[6,9]]

[2,5] merges with [1,3]

Constraints

0 <= len(intervals) <= 10^4
intervals sorted by start, non-overlapping

Hints

target: O(n) time⌘↩ run · ⇧⌘↩ submit

More intervals problems

Merge Booking Windowsmedium
Non-overlapping Intervalsmedium
Meeting Rooms IImedium