Overlapping interval pairs
Given a list of closed integer intervals [start, end], count how many unordered pairs (i, j) with i < j overlap — that is, share at least one point. The list holds at most a few hundred intervals, so comparing every pair is acceptable. Example: [[1,3],[2,5],[6,8]] gives 1, because only the first two share points.
Implement
count_overlapping_pairs(intervals: list[list[int]]) → intExamples
in
[[[1,3],[2,5],[6,8]]]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 10 min
solution.py
InputExpectedGot
[[[1,3],[2,5],[6,8]]]1not run yetsample