advancedConcurrency Machine Coding115 of 436
Design a distributed rate limiter — first defend which algorithm, then design it
Tests whether you can justify an algorithm choice (token bucket vs sliding window log vs sliding window counter) on accuracy-vs-memory trade-offs, then design the shared-state coordination (Redis + Lua script for atomicity) across nodes.
Ready to master this question?
Generate a complete walkthrough — background, the full answer in plain language, a working code example explained line by line, a real-world scenario, common mistakes, and how this same question gets asked in different ways.
Sign in to generate a response