# SMAWK Totally Monotone Rows: Practice Notes

SMAWK Totally Monotone Rows shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Exploit the totally monotone property so each row minimum of an implicit matrix is found by reducing columns in a linear number of comparisons.

## 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 + m) for an n by m totally monotone matrix.

## Common mistake

Discarding a column that still contains a later row minimum because the reduce step compared the wrong pair of entries.

## 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 https://www.linkjob.ai/.