Rate-Limited Duplicate Alerts | Dataford Interview Questions

Given a stream of events, design and implement a rate-limited alerting mechanism that suppresses duplicate alerts within a time window.

Each event is a dictionary with timestamp and key, and events arrive in nondecreasing timestamp order. Return the indices of events that should produce alerts. An event is suppressed when the same key produced an alert less than window seconds earlier; an event exactly window seconds later is allowed.

Function signature: def rate_limited_alerts(events, window):

Constraints

1 <= events.length <= 5000
0 <= events[i]["timestamp"] <= 10^9
events are sorted by nondecreasing timestamp
1 <= window <= 10^9
Each key is a non-empty string

Function Signature

def rate_limited_alerts(events, window):

Your question is Rate-Limited Duplicate Alerts. 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

Given a stream of events, design and implement a rate-limited alerting mechanism that suppresses duplicate alerts within a time window.

Function signature: def rate_limited_alerts(events, window):

Constraints

1 <= events.length <= 5000
0 <= events[i]["timestamp"] <= 10^9
events are sorted by nondecreasing timestamp
1 <= window <= 10^9
Each key is a non-empty string

Function Signature

def rate_limited_alerts(events, window):

Your question is Rate-Limited Duplicate Alerts. 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.