Solution: Min Stack

Understand how to implement a Min Stack that allows constant time operations for push, pop, and fetching the minimum element. This lesson explains using two stacks to track values and minimums efficiently, with methods ensuring O(1) time complexity and practical constraints.

We'll cover the following...

Statement
Solution
- Time complexity
- Space complexity

Statement

Design a custom stack class, Min Stack, allowing us to push, pop, and retrieve the minimum value in constant time. Implement the following methods for Min Stack:

Constructor: This initializes the Min Stack object.
Pop(): This removes and returns from the stack the value that was most recently pushed onto it.
Push(): This pushes the provided value onto the stack.
Min Number(): This returns the minimum value in the stack in $O(1)$ time.

Note: The time complexity of all the methods above should be $O(1)$ . ...