Search⌘ K
Home
Courses
Data Structures for Coding Interviews in Python

Solution: Min Stack

Explore how to build a min stack that supports push, pop, and retrieving the minimum value all in constant time. Understand the approach of using two stacks—one for all values and one to track the minimums—and analyze the time and space complexity of this implementation to strengthen your coding interview skills.

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
...