Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in C#

Solution: Longest Cycle in a Graph

Explore how to detect and measure the longest cycle in a directed graph with at most one outgoing edge per node. Understand the traversal method that tracks visit order using timestamps to identify cycles and calculate their lengths efficiently without redundant processing.

We'll cover the following...

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]. ...