Longest Cycle in a Graph

Each node has at most one outgoing edge, given by edges[i] (-1 for none). Print the length of the longest cycle, or -1 if there is none.

2 <= n <= 10^5