Rubrik low-level design interview
You design and build a small working system in code: classes, interfaces, data structures and how they change when a new requirement arrives. In India, the 90-minute machine coding round (Flipkart, PhonePe, Swiggy, Razorpay) is often the first filter for SDE 2.
| Progress | Problem as candidates report it | Next step |
|---|---|---|
| Bounded thread-safe blocking queue (LLD)Covered by the lesson: Producer-consumer and thread pools | Learn it | |
| Thread pool task executor with timeouts (LLD)Class diagram, Java code and follow-ups | Start | |
| Reader-writer lock (LLD)Covered by the lesson: Producer-consumer and thread pools | Learn it | |
| Thread-safe car and truck parking in a 1-D array (LLD)Class diagram, Java code and follow-ups | Start | |
| Logical page memory unit with recent-entry lookups (LLD)Being added: class diagram, Java code and follow-ups | Coming soon | |
| Concurrent insert, search and delete with exclusivity rules (LLD)Covered by the lesson: Thread safety: locks and atomics | Learn it | |
| Task rebalancing across worker nodes (LLD)Being added: class diagram, Java code and follow-ups | Coming soon | |
| Bounded buffer reading from two queues (LLD)Covered by the lesson: Producer-consumer and thread pools | Learn it |
How Rubrik runs it
- Build five classic systems end to end under a 90-minute timer: parking lot, splitwise, snake and ladder, rate limiter, in-memory key-value store.
- Separate models, services and storage; keep the main method thin.
- Learn when to use strategy, factory and observer patterns, and when not to.
- Handle invalid input explicitly: graders check validation.
The low-level design round, scored by level · New to LLD? Start with OOP, SOLID and the design patterns, then the machine coding problems.
Questions people ask
Does Rubrik have a low-level design or machine coding round?
Not as a fixed round, but candidates report object-oriented design questions: Bounded thread-safe blocking queue (LLD); Thread pool task executor with timeouts (LLD); Reader-writer lock (LLD); Thread-safe car and truck parking in a 1-D array (LLD); Logical page memory unit with recent-entry lookups (LLD); Concurrent insert, search and delete with exclusivity rules (LLD); Task rebalancing across worker nodes (LLD); Bounded buffer reading from two queues (LLD).