Stack With Minimum Tracking | Dataford Interview Questions

Implement a stack that can return the minimum value in constant time.

Implement min_stack(operations), where each operation is ['push', value], ['pop'], or ['getMin']. Return the values produced by pop and getMin in execution order. Inputs never pop from or query an empty stack.

Constraints

1 <= operations.length <= 100
Each push operation contains an integer value
-10^9 <= value <= 10^9
Every pop and getMin operation is applied to a non-empty stack
Operations are valid and appear in the stated format

Function Signature

def min_stack(operations):

Your question is Stack With Minimum Tracking. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Implement a stack that can return the minimum value in constant time.

Constraints

1 <= operations.length <= 100
Each push operation contains an integer value
-10^9 <= value <= 10^9
Every pop and getMin operation is applied to a non-empty stack
Operations are valid and appear in the stated format

Function Signature

def min_stack(operations):

Your question is Stack With Minimum Tracking. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.