GetMin in Stack O(1) | Dataford Interview Questions

Design a stack for a HashedIn request-processing component that supports retrieving the smallest stored value without scanning the stack. Implement get_min(operations) to process a sequence of stack commands and return the result of every getMin command.

Formal Specification

The input is a list of operations. Each operation is represented as a list:

["push", value] adds integer value to the top of the stack.
["pop"] removes the top element.
["getMin"] returns the smallest value currently in the stack.

Return a list of integers containing the results of getMin operations in their original order. The stack is initially empty. Every pop and getMin operation is guaranteed to be valid when executed.

Constraints

1 <= operations.length <= 10^5
-10^9 <= value <= 10^9
Every pop and getMin operation is performed on a non-empty stack.
Operation names are exactly "push", "pop", or "getMin".

Function Signature

def get_min(operations):

Your question is GetMin in Stack O(1). 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