Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.