Queue via Two Stacks | Dataford Interview Questions

Implement a queue using two stacks.

Asked in the round 1 stage. Started with O(2n) approach, optimized to O(n).

Implement queue_operations(operations). Each operation is either ["enqueue", value] or ["dequeue"]. Return an array containing the value returned by every dequeue operation. An empty dequeue returns None.

Constraints

1 <= len(operations) <= 1000
Each operation is either ["enqueue", value] or ["dequeue"]
Queue values are integers
Every operation is valid

Function Signature

def queue_operations(operations):

Your question is Queue via Two 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 two stacks.

Asked in the round 1 stage. Started with O(2n) approach, optimized to O(n).

Constraints

1 <= len(operations) <= 1000
Each operation is either ["enqueue", value] or ["dequeue"]
Queue values are integers
Every operation is valid

Function Signature

def queue_operations(operations):

Your question is Queue via Two 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.