Stack-Based Queue Implementation | Dataford Interview Questions

Implement a stack-based queue or solve a problem using queue data structures.

Implement process_queue(operations) using two stacks. Each operation is an array such as ["enqueue", value], ["dequeue"], or ["peek"]. Return the values produced by dequeue and peek, using null when either operation is attempted on an empty queue.

Input and Output

The input is a list of operation arrays. Return a list of outputs in the same order as output-producing operations.

Constraints

1 <= operations.length <= 10^5
Each operation is either ["enqueue", value], ["dequeue"], or ["peek"]
Values may be integers, strings, or other comparable Python objects
Empty dequeue and peek operations must return null in the output representation

Function Signature

def process_queue(operations):

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