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}$
• $0 \leq$ timestamp $\leq 10^{3}$
• Timestamps are in ascending order.
• Messages can be written in lowercase or uppercase English alphabets.

Note: In the following examples, the time limit, $S$, is set to $7$.

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground:

Note: In the following test cases, the time limit, $S$, is set to $7$.