Solution: Logger Rate Limiter

Explore how to implement an efficient logger rate limiter system that filters duplicate messages within a specified time frame. Understand both naive and optimized solutions using queues and hash maps, and learn to evaluate their time and space complexities to choose the best approach for message request filtering.

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}$

...