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

Solution: Min Stack

Explore how to implement a min stack data structure that allows push, pop, and minimum value retrieval all in constant time. Understand the use of a main stack and an auxiliary minimum stack to maintain efficient operations while keeping space complexity manageable. This lesson prepares you to solve min stack problems often seen in technical 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
...