Non-overlapping intervals
Given a set of intervals, return the minimum number you must remove so that the rest are non-overlapping.
Implement
erase_overlap_intervals(intervals: list[list[int]]) → intExamples
in
[[[1,2],[2,3],[3,4],[1,3]]]out1What 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.
0:00 of about 25 min
solution.py
InputExpectedGot
[[[1,2],[2,3],[3,4],[1,3]]]1not run yetsample