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

Solution: Min Stack

Understand how to implement a min stack data structure that supports push, pop, and retrieving the minimum value all in O(1) time. This lesson teaches you to use two stacks—one for values and one for tracking minimums—to efficiently solve a common interview problem.

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