Solution: Logger Rate Limiter

Explore how to build a logger rate limiter that determines if messages should be displayed based on timestamps using hash maps. Understand time and space complexity trade-offs, compare naive and optimized approaches, and implement an efficient solution that rejects duplicates within a time window.

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

...