Queue from Stacks | Dataford Interview Questions

Implement a queue using stack(s). Asked in the Technical Round 1 stage.

Use two stacks to process operations in first-in, first-out order. Implement queue_operations(operations), where each operation is one of ['push', value], ['pop'], ['peek'], or ['empty']. Return the results of pop, peek, and empty operations in order. Inputs will not call pop or peek when the queue is empty.

Constraints

1 <= operations.length <= 10^4
Each value supplied to push is an integer
pop and peek are called only when the queue is nonempty
Each operation is one of push, pop, peek, or empty

Function Signature

def queue_operations(operations):

Your question is Queue from Stacks. 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

Implement a queue using stack(s). Asked in the Technical Round 1 stage.

Constraints

1 <= operations.length <= 10^4
Each value supplied to push is an integer
pop and peek are called only when the queue is nonempty
Each operation is one of push, pop, peek, or empty

Function Signature

def queue_operations(operations):

Your question is Queue from Stacks. 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.