Code Room
CodingEasy
Question
A request counter receives ping timestamps in strictly increasing order. For each ping at time t, return the number of pings that happened in the inclusive window [t-3000, t] (including the current one). Given the list of timestamps, return the list of counts, one per ping.
Implement
recent_counter(pings: list[int]) → list[int]Examples
in
[[1,100,3001,3002]]out[1,2,3,3]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.