Design a bounded blocking queue (ring buffer)
PremiumMachine codingMedium
- Ring buffer
- Condition variables
- Producer consumer
Quick answer
This machine coding interview question asks you to design a bounded blocking queue (ring buffer). Aim for a design that meets its requirements at the stated scale, then explain its main components, data flow and trade-offs. Interviewers want to see how you scope the problem, size it and defend each choice.
The problem
Build a bounded blocking queue on a ring buffer: a fixed-capacity circular queue that many producer and consumer threads share, like the queues between pipeline stages in a data loader. Producers block when it is full and consumers block when it is empty. The hard part is getting blocking, timeouts and close right under real races.
Write working code in any language with threads, mutexes and condition variables (for example C++, Java, Go, Rust or Python). The buffer is a library, not a service.
What must a bounded blocking queue (ring buffer) do?
- Blocking put: put(item, timeoutMs?) adds an item, waiting while the buffer is full; it returns false if the timeout passes first.
- Blocking take: take(timeoutMs?) removes the oldest item, waiting while the buffer is empty; it returns an empty result if the timeout passes first.
How well must it do it?
- No lost or doubled items: Every item that was put successfully is taken exactly once, under any interleaving.
- No busy waiting: Blocked threads sleep on condition variables and wake only when the state they wait for may have changed.
What scale should you design for?
Use these numbers in your estimates.
The scale numbers unlock with this questionUnlock
Key concepts
- Ring buffer
- Condition variables
- Producer consumer
- Mutex
- Blocking queue
- Timeouts
How you’ll practise
- Requirements
- Entities and interfaces
- Core implementation
- Edge cases and tests
- Extensions
- Wrap-up
Lala, personalized to you, gives a hint when you ask and reviews your design when you are ready.
What do interviewers look for?
In any machine coding design round.
- Clarifies the requirements before drawing anything
- Uses a few numbers that actually change the design
- Draws a clear path from the client to storage
- Picks storage and caching with reasons, not by habit
- Explains what breaks first under load and how to fix it
- States trade-offs openly instead of claiming a perfect design
Questions people ask about this interview question
- Which design type is this question?
- It is a machine coding question. You design a bounded blocking queue (ring buffer) and explain your choices the way you would in an interview.
- Is this question asked at entry level?
- It is marked Medium. Entry-level engineers can practise it, but it expects you to reason about requirements and trade-offs, not only list components.
- What should I cover first?
- Start with the requirements: what the system must do, how well it must do it and which numbers change the design. Agree on scope with the interviewer before you design anything.
- Can I practise it for free?
- It is a premium question. Sign up and unlock it once for 10 credits; it then stays unlocked. When you finish, Lala, your personalized AI mentor, can review your design for 30 credits.
Related questions
Updated · Written by the SevyDevy team