Queue Data Structure Implementation | Dataford Interview Questions

Gro Intelligence processes ordered work items such as data refresh requests and alert evaluations. Implement a queue using two stacks, while preserving first-in, first-out behavior and achieving amortized O(1) time for each operation.

Write implement_queue(operations). Each operation is represented as an array. Supported operations are:

["enqueue", value]: Add value to the back of the queue. This operation produces no output.
["dequeue"]: Remove and return the front value. The input will not dequeue from an empty queue.
["peek"]: Return the front value without removing it. The input will not peek at an empty queue.
["size"]: Return the current number of queued values.

Return an array containing the results of dequeue, peek, and size operations in their original order. Do not include results for enqueue operations.

Constraints

1 <= operations.length <= 10^5
Each operation is valid and uses the specified format
Values may be integers, strings, booleans, or null
At most 10^5 values are held by the queue at once
dequeue and peek are never called when the queue is empty

Function Signature

def implement_queue(operations):

Your question is Queue Data Structure 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