Interval point cover
Given a set of closed intervals [start, end], find the minimum number of points such that every interval contains at least one of the chosen points (a point p stabs interval [s,e] if s <= p <= e). Return that minimum count. There are up to 10^5 intervals and coordinates fit in 32-bit ints.
Implement
min_stabbing_points(intervals: list[list[int]]) → intExamples
in
[[[1,3],[2,5],[4,6]]]out2What 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,3],[2,5],[4,6]]]2not run yetsample