CodingEasycod-g1464

Subject IntervalsLevel Entry–Mid~10 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

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

Examples

in[[[1,4],[2,2],[5,9]],2]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.