Implement stack with maximum function. All functions (pop, push, max) should be O(1)

Question

Niko · Accepted Answer

Such a stack does not exist...

Here's an example why: push N items onto stack in O(N) time.
Then retrieve N items with max function in O(N) time.
You just sorted N items in O(N+N) = O(N) time which is impossible.

Niko · Answer

Never mind, can be done with 2 stacks. Misinterpreted the question.

Amazon

Domanda di colloquio di Amazon

Risposte di colloquio

Aziende seguite

Ricerche di lavoro