Loading…
Loading…
Design a distributed job scheduler (cron-as-a-service). Users submit one-time and recurring jobs that must fire close to their scheduled time and execute via a worker fleet — without being lost, without silently double-running, and surviving worker and scheduler crashes. The hard parts are finding which jobs are due efficiently at scale and guaranteeing once-ish execution despite failures and round-time spikes when millions of jobs are all scheduled for the top of the hour. Scale: 100M+ jobs, ~10K submissions/sec.
Best after a few full reps. Expect follow-up questions, edge cases, and deeper trade-off discussion.
5 stages
45 min
Grade anytime
Workspace-first, hints visible, stage retry available. The cheap, repeatable loop — build the answer shape before you take it under pressure.
Solve once, compare against the checklist, then come back to the weak stage instead of starting over.
Strict timer, hints hidden, debrief deferred to the end. Use this once you can already structure a clean answer and want to pressure-test pacing and pushback.
Best after one structured rep · timed · focused on pacing and communication.
This is the framing pass. A strong answer quickly defines what the system must do, what quality bar it has to hit, and the numbers that will justify the rest of the design.
What must exist
What good looks like
Numbers to anchor the design
Each stage has a distinct job. Treat them like separate deliverables instead of one giant answer, and the round becomes much easier to navigate.
Define the contract clearly: the endpoints, auth boundary, error semantics, and the one or two decisions that matter most.
What you should produce
Define the interface. How does a user submit a job (with its schedule), cancel it, and check status? What stops a retried submit from creating dupl...
Strong answers cover
Lay out the main components and trace the write path, read path, and any async path cleanly.
What you should walk through
Walk me through the architecture.
Strong answers cover
Pick the store, show the schema or key model, and explain why that storage choice fits the access pattern.
What you should lock in
Get concrete about storage.
Strong answers cover
Name the first bottleneck, failure modes, and the trade-offs that keep the system fast and reliable under pressure.
What you should pressure-test
Now the deep dive. Two crux topics: the round-time thundering herd, and guaranteeing once-ish execution despite crashes. Then cover scheduler failo...
Strong answers cover
Translate the prompt into concrete requirements, scale, and trade-offs before drawing architecture.
Give APIs in the API stage, data models in the storage stage, and failure modes in scaling. Don't blur them together.
Grade early, compare to the reference reasoning criteria, fix the biggest misses, and re-submit the weak stage instead of starting over.
Related topics