# Largest Color Value In A Directed Graph: Study Guide
Largest Color Value In A Directed Graph shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Kahn topo DP: dp[u][c] is the max count of color c on any path ending at u; a leftover node means a cycle and the answer is -1, otherwise the global max dp value.
## 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(V+E).
## Common mistake
DFS without a cycle check, which infinite-loops, or taking a node's own color without adding the best predecessor count.
## 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 copilot.