# Maximum Difference Score In A Grid: Walkthrough
Maximum Difference Score In A Grid shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Score of a path that only moves right or down is grid[end]-grid[start] (you pick any two cells where end is down-right of start). For each possible end, you want end - min(grid of any cell that can reach it). Sweep in order and keep the running min on the prefix that can reach (r,c).
## 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(mn).
## Common mistake
Requiring an adjacent-step path score that sums every hop (this problem only uses the two endpoints).
## 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 the Linkjob AI app.