Code RoomPing counter
EasyPrep Room Coding #1347

Ping counter

CodingAlgorithms & data structuresEntry–Mid~15 min

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.

0:00 of about 15 min
InputExpectedGot
[[1,100,3001,3002]][1,2,3,3]not run yetsample