implement a stack with a method which can return the minimal value in the stack without remove this value.

Question

Anonymous · Accepted Answer

implement a stack in which each element record the reference of the minimal value in the previous elements. (or just keep an array to record the reference. can further reduce the space by just recording the decreasing numbers)

Ronny Vikes · Answer

use a second stack to track the min

Whoever · Answer

It's not sufficient just to update the min on push(0.
Need to be able to "backtrack" if pop() removes that min as well.

anon · Answer

I would have approached it like this:

Implement a stack with
- fields: size = size of stack, first = first node, min = min node
- methods/functions: pop, push, peek, min

Then as you insert each element, you update the reference to min.
When you call stack.min() - you get a reference to min

Amazon

Amazon interview question

Interview Answers

Want the inside scoop on your own company?

Bowls

Followed companies

Job searches