Min Max Stack Construction

Category: Stacks

Difficulty: Medium

Description

Write a MinMaxStack class for a Min Max Stack. The class should support:

• Pushing and popping values on and off the stack.
• Peeking at the value at the top of the stack.
• Getting both the minimum and the maximum values in the stack at any given point in time.

All class methods, when considered independently, should run in constant time and with constant space.

Sample Usage

// All operations below are performed sequentially.
MinMaxStack(): - // instantiate a MinMaxStack
push(5): -
getMin(): 5
getMax(): 5
peek(): 5
push(7): -
getMin(): 5
getMax(): 7
peek(): 7
push(2): -
getMin(): 2
getMax(): 7
peek(): 2
pop(): 2
pop(): 7
getMin(): 5
getMax(): 5
peek(): 5

Optimal Space & Time Complexity

All methods: O(1) time | O(1) space