# Path With Maximum Gold: Practice Notes

Path With Maximum Gold shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

DFS/backtrack from every gold cell, marking the cell empty while you visit so you cannot reuse it, and take the max path sum.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (graph BFS, Dijkstra, Union-Find, 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(k ยท 4^k) for k gold cells (grid is tiny).

## Common mistake

A greedy walk that always steps to the richest neighbor and gets stuck.

## 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 multilingual AI interview assistant.