CodingMediumcod-g196

Subject IntervalsLevel Mid–Senior~25 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

Given a list of intervals [start, end], return the minimum number of intervals you must remove so that the remaining intervals are pairwise non-overlapping. Intervals that only touch at an endpoint (e.g. [1,2] and [2,3]) are NOT considered overlapping. Return 0 for an empty list.

Implement

erase_overlap_intervals(intervals: list[list[int]]) → int

Examples

in[[[1,2],[2,3],[3,4],[1,3]]]out1

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.