CodingMediumcod-g426

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

Question

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]]) → int

Examples

in[[[1,3],[2,5],[4,6]]]out2

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.