# Minimum Falling Path Sum II: Explained

Minimum Falling Path Sum II shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Each step must change columns. Track the smallest and second-smallest values of the previous row (and the column of the smallest) so each cell of the next row can pick the best legal previous in O(1).

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n^2).

## Common mistake

Allowing the same column as the cell above (that is falling-path-sum I) or rescanning the whole previous row for every cell.

## 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 here.