Min Stack Implementation | Dataford Interview Questions

DataVisor's rule evaluation components may need to process alert scores while repeatedly querying the smallest active score. Design a Min Stack that supports push, pop, top, and getMin, with each operation running in O(1) time.

Implement min_stack(operations). Each operation is represented as a list: ['push', value] for insertion, or ['pop'], ['top'], and ['getMin'] for other operations. The function must return a list containing the results of pop, top, and getMin operations in encounter order. push produces no result. For valid inputs, pop, top, and getMin are never called on an empty stack.

Values are integers. Duplicate values must be handled correctly.

Constraints

1 <= len(operations) <= 10^5
-10^9 <= value <= 10^9
Every operation is valid for the current stack state.
At least one operation is push.

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

Values are integers. Duplicate values must be handled correctly.

Constraints

1 <= len(operations) <= 10^5
-10^9 <= value <= 10^9
Every operation is valid for the current stack state.
At least one operation is push.

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.