Trees and Graphs Coding | Dataford Interview Questions

Solve a problem involving trees or graphs.

Implement directed-cycle detection for a graph represented as an adjacency list. Return True if any directed cycle exists, otherwise return False.

Use has_cycle(graph), where graph[i] contains the integer vertices reachable from vertex i; vertices are numbered from 0 to len(graph) - 1.

Constraints

0 <= len(graph) <= 1000
Each neighbor is an integer from 0 through len(graph) - 1
The graph may be disconnected
The graph may contain self-loops and parallel edges

Function Signature

def has_cycle(graph):

Your question is Trees and Graphs Coding. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem