Point coverage count
Given a list of closed integer intervals [start, end] and a query point q, return how many intervals contain q — that is, satisfy start <= q <= end. Bounds may be negative. Example: intervals [[1,4],[2,2],[5,9]] with q = 2 gives 2.
Implement
count_containing(intervals: list[list[int]], q: int) → intExamples
in
[[[1,4],[2,2],[5,9]],2]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 10 min
solution.py
InputExpectedGot
[[[1,4],[2,2],[5,9]],2]2not run yetsample