Minimum points covering intervals
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]]) → intExamples
in
[[[1,3],[3,7],[8,9]]]out5What 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 40 min
solution.py
InputExpectedGot
[[[1,3],[3,7],[8,9]]]5not run yetsample