Solution: Min Stack
Explore how to design a Min Stack data structure enabling push, pop, and minimum retrieval operations all in constant time. Understand the use of two stacks to maintain current minimum values efficiently while preserving stack performance. This lesson guides you through implementing these methods and analyzing their time and space complexities.
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 ...