Min Stack Design | Dataford Interview Questions

Min Stack (design a stack supporting push/pop/getMin in O(1))

Asked in the phone screen stage. 60-min phone screen coding portion.

Implement min_stack(operations). Each operation is a list: ["push", value], ["pop"], or ["getMin"]. Process operations in order and return a list containing the result of every getMin operation. push and pop do not add results. Inputs are valid: pop and getMin are never called when the stack is empty.

Constraints

1 <= len(operations) <= 10^4
Each operation is ["push", value], ["pop"], or ["getMin"]
Values are integers in [-10^9, 10^9]
Every pop and getMin operation is valid because the stack is nonempty
Only getMin operations contribute to the output

Function Signature

def min_stack(operations):

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

Min Stack (design a stack supporting push/pop/getMin in O(1))

Asked in the phone screen stage. 60-min phone screen coding portion.

Constraints

1 <= len(operations) <= 10^4
Each operation is ["push", value], ["pop"], or ["getMin"]
Values are integers in [-10^9, 10^9]
Every pop and getMin operation is valid because the stack is nonempty
Only getMin operations contribute to the output

Function Signature

def min_stack(operations):

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