Code Room
CodingMedium
Question
Given a list of non-overlapping intervals [start, end] sorted by start, insert a new interval, merging where necessary so the result stays non-overlapping and sorted. Two intervals merge if they overlap or touch at an endpoint. Return the resulting list. The input list may be empty.
Implement
insert_interval(intervals: list[list[int]], newInterval: list[int]) → list[list[int]]Examples
in
[[[1,3],[6,9]],[2,5]]out[[1,5],[6,9]]What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
Learn the concepts
Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.
Run or narrate your approach, then ask the coach.