Design a 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 operations. Use two internal stacks to support FIFO ordering.

Input and Output

Implement queue_using_stacks(operations). Each operation is ['enqueue', value], ['dequeue'], ['peek'], or ['empty']. Return a list containing the result of every dequeue, peek, or empty operation. Inputs will not dequeue or peek from an empty queue.

Constraints

0 <= operations.length <= 1000
Each operation is enqueue, dequeue, peek, or empty
enqueue values are integers
dequeue and peek operations are only applied to a nonempty queue

Function Signature

def queue_using_stacks(operations):

Your question is Design a 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