Solution: Min Stack
Let's solve the Min Stack problem using the Custom Data Structure pattern.
We'll cover the following...
We'll cover the following...
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 time. 
Note: The time complexity of all the methods above should be . ...