Solution: Logger Rate Limiter

Understand how to implement a logger rate limiter that tracks message timestamps and filters duplicates within a set time window. Learn to use hash maps for constant-time checks and updates, improving efficiency over naive queue-based solutions. This lesson helps you design and optimize algorithms controlling message displays in real-time streams.

We'll cover the following...

Statement
Solution
- Naive approach
- Optimized approach using hash maps

Statement

For the given stream of message requests and their timestamps as input, you must implement a logger rate limiter system that decides whether the current message request is displayed. The decision depends on whether the same message has already been displayed in the last $S$ seconds. If yes, then the decision is FALSE, as this message is considered a duplicate. Otherwise, the decision is TRUE.

Note: Several message requests, though received at different timestamps, may carry identical messages.

Constraint:

$1 \leq$ request.length $\leq 10^{2}$

...