Thread-Safe Bounded Priority Queue | Dataford Interview Questions

Problem

Implement a thread-safe bounded priority queue for tasks. The queue stores tasks as (priority, task_id, payload) and supports concurrent producers and consumers. Write a class with methods push(priority, task_id, payload), pop(), and size(). If the queue is full, push must block until space is available; if it is empty, pop must block until an item is available. Higher priority values must be returned first, and tasks with the same priority must be returned in FIFO insertion order.

Constraints

1 <= capacity <= 10^5
At most 10^5 total push and pop operations in a test
priority is an integer in the range [-10^9, 10^9]
task_id values are unique per successful push
Each operation must be safe under concurrent access by multiple threads

Problem

Constraints

1 <= capacity <= 10^5
At most 10^5 total push and pop operations in a test
priority is an integer in the range [-10^9, 10^9]
task_id values are unique per successful push
Each operation must be safe under concurrent access by multiple threads

Problem

Constraints

1 <= capacity <= 10^5
At most 10^5 total push and pop operations in a test
priority is an integer in the range [-10^9, 10^9]
task_id values are unique per successful push
Each operation must be safe under concurrent access by multiple threads

Problem

Constraints

1 <= capacity <= 10^5
At most 10^5 total push and pop operations in a test
priority is an integer in the range [-10^9, 10^9]
task_id values are unique per successful push
Each operation must be safe under concurrent access by multiple threads