Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in C++

Solution: Logger Rate Limiter

Explore how to implement a logger rate limiter system that filters out duplicate messages within a given time window. Learn to optimize message processing using hash maps for constant time checks, balancing time and space complexity, and apply this pattern to coding interview problems related to efficient data retrieval with hash maps.

We'll cover the following...

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

Constraint:

  • 1≤1 \leq request.length ≤102\leq 10^{2}
...