Min Stack in O(1) | Dataford Interview Questions

Your question is Min Stack in O(1). Start with the requirements on the right.

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

Problem

Saviynt access-request processing needs a stack that can retrieve the lowest risk score currently present without scanning all pending requests. Implement process_min_stack(operations) to process stack commands while ensuring every command runs in O(1) time.

Formal Specification

operations is a list of commands. A push command has the form ["push", value]; pop and minimum queries have the forms ["pop"] and ["get_min"].
value is an integer.
Return a list containing the result of every pop and get_min command, in execution order. Push commands produce no output.
The input will never attempt pop or get_min on an empty stack.

Constraints

1 <= len(operations) <= 10^5
-10^9 <= value <= 10^9
Each command is valid and uses the specified format
Pop and minimum commands are never applied to an empty stack

Function Signature

def process_min_stack(operations):

Your question is Min Stack in O(1). Start with the requirements on the right.

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

Formal Specification

operations is a list of commands. A push command has the form ["push", value]; pop and minimum queries have the forms ["pop"] and ["get_min"].
value is an integer.
Return a list containing the result of every pop and get_min command, in execution order. Push commands produce no output.
The input will never attempt pop or get_min on an empty stack.

Constraints

1 <= len(operations) <= 10^5
-10^9 <= value <= 10^9
Each command is valid and uses the specified format
Pop and minimum commands are never applied to an empty stack

Function Signature

def process_min_stack(operations):