CodingHardcod-g853

Subject IntervalsLevel Senior–Staff~40 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

Given a set of closed integer intervals, find the size of the SMALLEST set S of integers such that every interval contains at least TWO distinct elements of S. Return that minimum size.

Implement

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

Examples

in[[[1,3],[3,7],[8,9]]]out5

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.