# Dungeon Game: Walkthrough
Dungeon Game shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Work backwards from the princess: dp[i][j] is the min HP you need when entering (i,j) so you can still reach the end. dp[i][j] = max(1, min(dp[i+1][j], dp[i][j+1]) - dungeon[i][j]).
## 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
A forward max-HP or max-path-sum scan, which cannot recover from a later deadly cell the way a backward "need" DP can.
## 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 try it free.