Solution: Longest Cycle in a Graph

Explore how to identify and measure the longest cycle in a directed graph where each node has at most one outgoing edge. Understand a step-based iterative traversal method that detects cycles by tracking node visits efficiently. This lesson guides you through implementing the solution in JavaScript, analyzing its time and space complexities, and applying core graph traversal techniques to find the longest cycle or return -1 if none exist.

We'll cover the following...

Statement
Solution
- Time complexity
- Space complexity

Statement

You are given a directed graph with n nodes, labeled from 0 to n - 1. Each node in the graph has at most one outgoing edge.

The graph is described using a 0-indexed integer array edges of length n, where:

edges[i] represents a directed edge from node i to node edges[i].
If node i has no outgoing edge, edges[i] == -1.

Your task is to find longest cycle length in the graph. If no cycle exists, return -1.

Note: A cycle is defined as a path that starts and ends at the same node, following the direction of the edges.

Constraints:

n $==$ edges.length
$2 \leq$ ...