Rate Limiting for Webhooks | Dataford Interview Questions

Implement a rate-limiter for an API endpoint that handles incoming voice call webhooks at FleetWorks, ensuring we do not overload downstream services. Given nondecreasing request timestamps, a maximum request count, and a time window, return whether each webhook is accepted. Use a sliding-window policy: an accepted request at time t counts for timestamps in (t - window, t]. Rejected requests do not consume capacity. Implement rate_limit_requests(timestamps, limit, window), returning a Boolean list with one result per timestamp.

Constraints

0 <= timestamps.length <= 5000
0 <= timestamps[i] <= 10^9
timestamps is sorted in nondecreasing order
1 <= limit <= 10^5
1 <= window <= 10^9

Function Signature

def rate_limit_requests(timestamps, limit, window):

Your question is Rate Limiting for Webhooks. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Constraints

0 <= timestamps.length <= 5000
0 <= timestamps[i] <= 10^9
timestamps is sorted in nondecreasing order
1 <= limit <= 10^5
1 <= window <= 10^9

Function Signature

def rate_limit_requests(timestamps, limit, window):

Your question is Rate Limiting for Webhooks. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.