Implement Stack Using Queue | Dataford Interview Questions

How would you implement a stack using a queue data structure?

Implement implement_stack(operations) using one queue. Each operation is an array: ["push", value], ["pop"], ["top"], or ["empty"]. Return the results of pop, top, and empty operations in order. pop and top are only called when the stack is non-empty.

Example: [["push", 1], ["push", 2], ["top"], ["pop"], ["empty"]] returns [2, 2, false].

Constraints: at most 10^4 operations, and pushed values are integers.

Constraints

1 <= operations.length <= 10^4
Each operation is one of ["push", value], ["pop"], ["top"], or ["empty"]
Pushed values are integers
pop and top are called only when the stack is non-empty

Function Signature

def implement_stack(operations):

Your question is Implement Stack Using Queue. 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