← Questions
Queue using two stacks
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Implement a first-in, first-out queue (push, pop, peek, empty) using only two stacks. Move items from the input stack to the output stack only when the output stack is empty, and explain why each operation is constant time amortized.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding
