Solution: Logger Rate Limiter

Let's solve the Logger Rate Limiter problem using the Hash Map pattern.


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 SS 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.


  • 11 \leq request.length 102\leq 10^{2}
  • 00 \leq timestamp 103\leq 10^{3}
  • Timestamps are in ascending order.
  • Messages can be written in lowercase or uppercase English alphabets.

Level up your interview prep. Join Educative to access 70+ hands-on prep courses.