Search⌘ K
Home
Courses
Data Structures for Coding Interviews in C++

Solution: Min Stack

Understand how to implement a Min Stack data structure that supports push, pop, and retrieving the minimum element in constant time. Explore the use of two stacks to maintain current minimum values efficiently and analyze the time and space complexities involved in this approach.

We'll cover the following...

Statement

Design a stack data structure to retrieve the minimum value in O(1)O(1) 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 O(1)O(1).

Constraints:

  • −105≤-10^5 \leq
...