Implement Queue using Stacks · Coding Interview Practice

Implement Queue using StacksImplement a FIFO queue using only two stacks, supporting push, pop, peek, and empty.Constraints

All operations must be valid (no pop or peek on an empty queue)

At most 100 calls are made

Examples

Input: push(1), push(2), peek() Output: 1

Input: pop(), empty() Output: pop=1, empty=false

LetsDiscuss

Loading your session…