Logger Rate Limiter

Explore how to implement a logger rate limiter system that decides if messages should be displayed based on recent duplicates. Learn to use hash maps effectively to track message timestamps and ensure no repeats within a specified time window.

We'll cover the following...

Statement
Examples
Understand the problem
Figure it out!
Try it yourself

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$

...