Solution: Min Stack
Let’s solve the Min Stack problem.
We'll cover the following
Statement
Design a stack data structure to retrieve the minimum value in time. The following functions must be implemented:
min()
: Returns the minimum value in the stack in constant time.push(int value)
: Pushes a value onto the stack.pop()
: Removes and returns a value from the top of the stack.
All functions should be implemented with a time complexity of .
Constraints:
-
value
Level up your interview prep. Join Educative to access 80+ hands-on prep courses.