# Longest Univalue Path: Practice Notes
Longest Univalue Path shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
DFS returns the longest univalue arrow downward; if a child matches the node you can extend it. The answer is the best left-arrow + right-arrow through any node.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (tree DFS, BST walk, or subtree 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(n).
## Common mistake
Requiring the path to go through the root.
## 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 AI interview helper that uses your resume.