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

Solution: Min Stack

Explore how to implement a min stack that supports constant time retrieval of the minimum value. Understand the use of two stacks to achieve O(1) time complexity for push, pop, and min operations along with their space complexity. This lesson helps you master an efficient stack design critical for coding interviews.

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