# Longest Cycle In A Graph: Practice Notes

Longest Cycle In A Graph 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 the graph is cycles with trees feeding in. A color DFS (or path-index map) detects the cycle length when a node on the current path is seen again; take the global max, or -1 if none.

## 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

Running a general all-cycles algorithm, or reporting the first back-edge without measuring the cycle length along the current 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 real-time interview help.