Interview Guides

Detect Cycles in Directed Graph

Medium

dfscycle detectionGraphs

Problem

Given a directed graph with n nodes labeled from 0 to n - 1 and a list of directed edges edges, determine whether the graph contains a cycle. Return True if any cycle exists and False otherwise. The graph may be disconnected.

Constraints

1 <= n <= 10^5
0 <= edges.length <= 2 * 10^5
0 <= u, v < n for every edge [u, v]
Self-loops and duplicate edges may appear

Problem

Constraints

1 <= n <= 10^5
0 <= edges.length <= 2 * 10^5
0 <= u, v < n for every edge [u, v]
Self-loops and duplicate edges may appear

Practice Python

Python 3.10

Open on desktop for the full Python editor with syntax highlighting and autocomplete.

Up next

Detect Cycles in Resource GraphMedium

Detect Cycles in GraphsMedium

Shortest Path and ComponentsMedium

Next question

All questions/Coding

Detect Cycles in Directed Graph

Medium

dfscycle detectionGraphs

Problem

Constraints

1 <= n <= 10^5
0 <= edges.length <= 2 * 10^5
0 <= u, v < n for every edge [u, v]
Self-loops and duplicate edges may appear

Problem

Constraints

1 <= n <= 10^5
0 <= edges.length <= 2 * 10^5
0 <= u, v < n for every edge [u, v]
Self-loops and duplicate edges may appear

Practice Python

Python 3.10

Open on desktop for the full Python editor with syntax highlighting and autocomplete.

Up next

Detect Cycles in Resource GraphMedium

Detect Cycles in GraphsMedium

Shortest Path and ComponentsMedium

Next question

Detect Cycles in Directed Graph | Dataford Interview Questions