Min Stack Implementation | Dataford Interview Questions

How to implement a min stack?

Implement min_stack(operations) using a stack that supports push, pop, top, and getMin. Each operation must run in O(1) time. Return results for pop, top, and getMin operations in execution order; push produces no result.

Each operation is represented as ['push', value] or [operation]. Inputs are valid and never pop or inspect an empty stack.

Constraints

1 <= operations.length <= 500
Each operation is ['push', value], ['pop'], ['top'], or ['getMin']
-10^9 <= value <= 10^9
The stack is non-empty for every pop, top, and getMin operation
Return results only for pop, top, and getMin operations

Function Signature

def min_stack(operations):

Your question is Min Stack Implementation. 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

How to implement a min stack?

Each operation is represented as ['push', value] or [operation]. Inputs are valid and never pop or inspect an empty stack.

Constraints

1 <= operations.length <= 500
Each operation is ['push', value], ['pop'], ['top'], or ['getMin']
-10^9 <= value <= 10^9
The stack is non-empty for every pop, top, and getMin operation
Return results only for pop, top, and getMin operations

Function Signature

def min_stack(operations):

Your question is Min Stack Implementation. 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.