CodingMediumcod-g338

Subject StacksLevel Entry–Mid~20 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

Implement a stack supporting push, pop, top, and getMin (the minimum element currently in the stack) all in O(1). Process ops: ['push', x], ['pop'], ['top'], ['getMin']. pop returns nothing. Return the list of values produced by 'top' and 'getMin' ops, in order. Assume top/getMin/pop are never called on an empty stack.

Implement

min_stack_ops(ops: list[list]) → list[int]

Examples

in[[["push",-2],["push",0],["push",-3],["getMin"],["pop"],["top"],["getMin"]]]out[-3,0,-2]

What a strong answer looks like

State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.