Challenge: Detect Cycle in a Directed Graph
Try to solve the Detect Cycle in a Directed Graph problem.
We'll cover the following
Statement
Given a directed graph, check whether the graph contains a cycle and return a boolean value accordingly.
A cycle occurs when you can start at one vertex, follow a path through the edges, and return to the starting vertex. This means at least one vertex is visited more than once within the same traversal path.
Note: Edges list is interpreted in the following manner:
edges = [[0, 2, 1], [], [2, 1, 0]]
Interpretation:
None
Constraints:
If n
is the number of nodes in the graph.
n
-
n
-
edges[i]
Examples
Level up your interview prep. Join Educative to access 80+ hands-on prep courses.