Leetcode 232. Implement Queue using Stacks

Implement a FIFO queue using only stack operations (push, pop/peek, size/isEmpty) by composing two stacks to support push, pop, peek, and empty. Aim for an amortized O(1) solution by lazily transferring elements between the two stacks.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 232. Implement Queue using Stacks

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact