# Maximum Score After Applying Operations On A Tree: Interview Notes
Maximum Score After Applying Operations On A Tree shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
You must leave at least one node untaken on every root-to-leaf path. Maximize the sum of taken nodes with a tree DP: the leftover in a subtree is the cheapest way to keep one root-to-leaf path intact.
## 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
Taking every node, which empties some path.
## 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 assistant.