# Longest Cycle In A Network: Interview Notes
Longest Cycle In A Network shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Each node has outdegree at most 1, so follow the unique path and timestamp visits; when you re-enter a node from the current walk, the cycle length is now-start.
## 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
Running DFS-with-stack on a general graph and missing that the functional-graph structure lets you solve it in linear time, or reporting a cycle you already counted from another entry.
## 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 Linkjob AI interview assistant.