Fixed window limiter
Implement a per-key fixed-window counter rate limiter. Given a list of (key, ts) requests in non-decreasing ts order (integer seconds), a 'limit', and a 'window' size in seconds, each request maps to the fixed window index ts // window. A request is allowed if, for its key and its window index, fewer than 'limit' requests have already been allowed; allowed requests increment that key+window counter. Windows are independent and counters do not carry over. Return a list of booleans aligned to the input. Empty input returns an empty list.
fixed_window(requests: list[tuple], limit: int, window: int) → list[bool][[["a",0],["a",1],["a",2]],2,10]out[true,true,false]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.
[[["a",0],["a",1],["a",2]],2,10][true,true,false]not run yetsample