# Dungeon Game: Interview Notes

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

## Key idea

DP backwards from the princess: health[i][j] = max(1, min(right, down) - dungeon[i][j]) so you never drop to 0.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (string DP, sliding window, trie, or interval DP) and why a simpler scan 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-path that can go through a deadly cell because later rooms look rich.

## 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 this tool.