Question

Implement a sliding-window rate limiter. A client may make at most `limit` requests within any window of `window` seconds. Given a list of request timestamps (non-decreasing non-negative integers), decide each request in order: a request at time t is ALLOWED if, counting it, the number of allowed requests with timestamp > t - window (i.e. strictly within the trailing window) is at most `limit`; otherwise it is DENIED and is NOT recorded. Only allowed requests count toward future windows. Return a list of booleans, True for allowed and False for denied. limit is a positive integer; window is a positive integer.