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

Solution: Min Stack

Explore how to implement a stack data structure that supports push, pop, and retrieving the minimum element all in O(1) time. Understand the use of two stacks to maintain the current minimum efficiently and analyze the time and space complexities to prepare 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
...