Detect Cycles in Task Graph

MediumPython00:00

Practice interviewer

In session

5 left

00:00

Your question is Detect Cycles in Task Graph. Start with the requirements on the right.

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

You need to log in / sign up to run or submit.

Problem

Given a directed graph of startup task dependencies, write a function that returns True if the graph contains a cycle and False otherwise. The input is a list of task names tasks and a list of directed edges dependencies, where each edge [a, b] means task a depends on task b.

Constraints

1 <= len(tasks) <= 10^5
0 <= len(dependencies) <= 2 * 10^5
Task names are unique strings
Each dependency is a pair [task, prerequisite]
A dependency may reference any task in tasks

Function Signature

def has_cycle(tasks, dependencies):

Your solutionPython 3

You need to log in / sign up to run or submit.

Run your code to see test output