# Longest Path With Different Adjacent Characters: Explained
Longest Path With Different Adjacent Characters shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
A tree with a letter on each node; a valid path has different letters on adjacent nodes. DFS returns the longest downward valid chain from this node; combine the top two child chains whose letters differ from the node to update a global max path.
## 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(n).
## Common mistake
Allowing adjacent equal letters, or treating the input as a general graph and running all-pairs paths.
## 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 tool for job interviews.