Longest Cycle in a Graph: coding question

Available question text

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.

Continue with questions that share topics or the same question type.

Distance to a Cycle in Undirected Graph
Coding · Breadth-First Search · Depth-First Search · Graph Theory
Alien Dictionary
Coding · Array · Breadth-First Search · Depth-First Search
Course Schedule
Coding · Breadth-First Search · Depth-First Search · Directed Acyclic Graph
Course Schedule II
Coding · Breadth-First Search · Depth-First Search · Graph Theory

Sources · 2 references

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 1 record

Anduril
Leetcode 2360. Longest Cycle in a Graph
Reported Oct 9, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source

LeetCode company tags · 2 records

Anduril
Longest Cycle in a Graph
Reported date not specified · Source window: 3mo
Source snapshot: Oct 20, 2026
Source frequency score: 81.2. This is not an interview probability.
View source
Anduril
Longest Cycle in a Graph
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 75.7. This is not an interview probability.
View source

Longest Cycle in a Graph

Available question text

Related questions

Longest Cycle in a Graph

Available question text

Related questions