# Min Stack: Walkthrough

Min Stack shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Store pairs (value, min_so_far) or a parallel min stack: push updates the current min, pop restores the previous one, getMin is O(1) as the top of the min stack.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (linked-list rewiring, two pointers, or a monotonic stack) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(1) per op.

## Common mistake

Scanning the whole stack on getMin, which violates the O(1) requirement.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at Linkjob AI.