# LC6208 Path Sum III **Idea.** prefix DFS. **Checklist** - Clarify constraints and edge cases first - Name the pattern (two pointers / DP / graph / binary search) - Walk one example end-to-end before coding - State time/space; watch off-by-one *Disclosure: I help build [AI coding interview assistant](https://www.linkjob.ai/) — an interview prep copilot. Notes are my own study notes.*