Queue Using Stack | Dataford Interview Questions

Design Queue using stack as datastructure ?

Asked in the LLD and Concurrency stage. Implement queue behavior using only stack-based structures.

Contract

Implement def queue_operations(operations):. Each operation is a list containing ['enqueue', value], ['dequeue'], ['peek'], or ['is_empty']. Return a list containing the result of every dequeue, peek, and is_empty operation. Return None for dequeue or peek when the queue is empty.

Constraints

1 <= len(operations) <= 1000
Each operation is either ['enqueue', value], ['dequeue'], ['peek'], or ['is_empty']
Enqueued values are integers
Return None for dequeue or peek on an empty queue

Function Signature

def queue_operations(operations):

Your question is Queue Using Stack. 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