Practice Google Coding Question | Real Coding Interviews | Hack2hire

NewDark mode is now available across the siteSee what's new

Question Bank Pricing Blog Forum

Quick Summary

Design a persistent rate limiter that processes one domain request per second.
Enforce two sliding window constraints per domain: max 2 requests in 5 seconds and max 5 in 30 seconds.
Track global time and only count accepted requests toward future limits.

What This Tests

Hash table usage for domain-specific state management
Sliding window logic over discrete time steps
Efficient data structure operations for expiry cleanup
State persistence across function calls

Common Patterns

Sliding Window

Hashing

Accepted

36/120

Acceptance Rate30.0%

Test Cases

Input

Output

Expected