Implement a Queue using Stacks

Question

Accepted Answer

Implement a First-In-First-Out (FIFO) queue using only two stacks. The implemented queue should support all the functions of a normal queue (`push`, `peek`, `pop`, and `empty`).

Implement a Queue using Stacks

Question Explain

Start Trying This Question Simulation

Other interview questions like this

Reverse a Linked List

Kth Smallest Element in a BST

Lowest Common Ancestor of a BST