Producer-Consumer with Circular Queue | Dataford Interview Questions

Solve a producer-consumer problem: implement a runnable circular queue (initial size 10) on the whiteboard, and design how it resizes dynamically when 90% of the time it holds 7-8 elements but 10% of the time must hold 500 without losing data.

Asked in the Round 3 (onsite) stage.

Implement def circular_queue_operations(operations):. Each operation is ['enqueue', value], ['enqueue_many', values], ['dequeue'], ['size'], or ['capacity']. Return outputs from dequeue, size, and capacity in execution order. Empty dequeue returns None. Start with capacity 10, double when full, and halve when usage reaches at most 25%, never below 10. Preserve FIFO order during resizing.

Constraints

1 <= len(operations) <= 2000
Each operation is valid and has the required operands
Queue values are integers
The initial capacity is 10
Capacity doubles when full and halves at or below 25 percent occupancy, never below 10

Function Signature

def circular_queue_operations(operations):

Your question is Producer-Consumer with Circular Queue. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Asked in the Round 3 (onsite) stage.

Constraints

1 <= len(operations) <= 2000
Each operation is valid and has the required operands
Queue values are integers
The initial capacity is 10
Capacity doubles when full and halves at or below 25 percent occupancy, never below 10

Function Signature

def circular_queue_operations(operations):

Your question is Producer-Consumer with Circular Queue. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.