← Back to problems Related: LeetCode 359 →

Rate Limiter

AeroSpace • Sliding window on timestamps • deque / queue

Allow at most N events in any rolling window of length T (time units). Store event times in order; drop timestamps older than now − T from the front, then accept if fewer than N remain.

AllowO(k)k pops

TypicalO(1)amortized

SpaceO(N)window

Step0/0

Ready

Press Play or Step. Demo uses N = 2, T = 10. Each step shows allow(now) and the deque of timestamps after the call.

Speed:

⌨ Type It

Python: use a deque for popleft() in O(1). Same logic as the C++ snippet.

═══ RATE LIMITER — WINDOW ═══

① Drop front while now − q[0] > T

② If len(q) < N: append(now), return True

③ Else return False

Verify: