Logger Rate Limiter

Understand how to design and implement a logger rate limiter that uses hash maps to track and filter out repeated messages within a specific time window. This lesson helps you apply hash map operations to solve messaging duplication problems effectively.

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$

...