Duplicate Events in Time Window | Dataford Interview Questions

Problem

Given a list of packet events events, where each event is a pair [timestamp, event_id] sorted by non-decreasing timestamp, and an integer window_size, return True if any event_id appears at least twice such that the difference between the two timestamps is at most window_size. Otherwise, return False.

Constraints

1 <= len(events) <= 10^5
0 <= timestamp <= 10^9
events[i] = [timestamp, event_id]
events is sorted by non-decreasing timestamp
0 <= window_size <= 10^9

Problem

Constraints

1 <= len(events) <= 10^5
0 <= timestamp <= 10^9
events[i] = [timestamp, event_id]
events is sorted by non-decreasing timestamp
0 <= window_size <= 10^9

Problem

Constraints

1 <= len(events) <= 10^5
0 <= timestamp <= 10^9
events[i] = [timestamp, event_id]
events is sorted by non-decreasing timestamp
0 <= window_size <= 10^9

Problem

Constraints

1 <= len(events) <= 10^5
0 <= timestamp <= 10^9
events[i] = [timestamp, event_id]
events is sorted by non-decreasing timestamp
0 <= window_size <= 10^9