# Out Of Boundary Paths: Practice Notes
Out Of Boundary Paths shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
DP[moves][r][c] = ways to be at (r,c) with `moves` left (or used). From each cell try 4 directions; a step that leaves the grid adds one path. Mod 10^9+7.
## 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(m * n * maxMove).
## Common mistake
Stopping a path when it would go out (so you never count that exit) or using an un-modded DFS that explodes.
## 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 real-time interview help.