← Questions
Max stack
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Design a stack that also supports peekMax() and popMax() (removing the top-most copy of the largest value), along with push, pop and top. Compare a two-stack design with a doubly linked list plus a sorted map or heap, and give each operation's cost.
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