Leetcode 2360. Longest Cycle in a Graph

Given a functional directed graph (each node has at most one outgoing edge), return the length of the longest directed cycle or -1 if no cycle exists. With n up to 1e5, detect and measure cycles efficiently across components without revisiting nodes excessively.