# Candy: Walkthrough
Candy shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Two passes: left-to-right give more than the left neighbor when the rating rises, then right-to-left with the other neighbor, and take the max at each child.
## 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(n).
## Common mistake
A single left-to-right sweep, which cannot fix a long descending slope.
## 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 learn more.