193. Min Stack

Medium

Topics

Companies

Hint

Understand Before Coding

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

Example 1:

Input: ["MinStack","push","push","push","getMin","pop","top","getMin"] [[],[-2],[0],[-3],[],[],[],[]]

Output: [null,null,null,null,-3,null,0,-2]

Explanation: MinStack minStack = new MinStack(); minStack.push(-2); minStack.push(0); minStack.push(-3); minStack.getMin(); // return -3 minStack.pop(); minStack.top(); // return 0 minStack.getMin(); // return -2

Constraints:

•
•
•

Time Complexity

o(1)

Space Complexity

o(n)

193. Min Stack

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Constraints:

Learn

Topics

Companies

Hint

Use Cases

193. Min Stack

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Constraints:

Learn

Topics

Companies

Hint

Use Cases