Write a function to detect a cycle in a directed graph using the DFS algorithm.

Hard

Graph: { 0: [1], 1: [2], 2: [0], 3: [4], 4: [] }

Cycle detected: true

Time: 2s · Memory: 256 MB

Code Editor

00:00

function detectCycle(graph: { [key: number]: number[] }): boolean { // Your logic here }

Input

Graph: { 0: [1], 1: [2], 2: [0], 3: [4], 4: [] }

Expected Output

Cycle detected: true

Custom Input (stdin)

Program Output

> Run your code to see console output.

Programming Exercises