Available question text
Implement a thread-safe bounded FIFO queue with a fixed capacity that supports enqueue (blocks when full), dequeue (blocks when empty), and size operations. The core challenge is correct synchronization—ensuring threads block and wake appropriately without race conditions, deadlocks, or lost wake-ups (using locks/condition variables or semaphores).
Related questions
Continue with questions that share topics or the same question type.
- Implement thread-safe blocking queue
Coding
- Count of Sub-Multisets With Bounded Sum
Coding
- Design a Deque (Double-Ended Queue)
Coding
- Design Circular Queue
Coding · Array · Design · Linked List
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
OpenAI
Leetcode 1188. Design Bounded Blocking Queue
Reported Oct 1, 2026 · 2 source reports
STAFF
Source snapshot: Nov 12, 2026
View source