algorythms
Merge Intervals
LC #57Medium

Insert Interval

Merge Intervals
AmazonGoogleMetaLinkedIn

Problem

Insert a new interval into a sorted non-overlapping list and merge if necessary.

arraymerge-intervals

Constraints

  • 0 ≤ n ≤ 10⁴
  • intervals is sorted by startᵢ and non-overlapping
  • 0 ≤ startᵢ ≤ endᵢ ≤ 10⁵

Example

Inputintervals = [[1,3],[6,9]], newInterval = [2,5]
Output[[1,5],[6,9]]
Why

[1,3] and [2,5] overlap → merged to [1,5]; [6,9] untouched

Hints — reveal one at a time