Detect Cyclic Package Imports | Dataford Interview Questions

Implement an algorithm to detect cyclic dependencies in a list of package imports.

Represent imports as a dictionary mapping each package name to a list of packages it imports. Return True if the directed dependency graph contains a cycle, including a self-import, and False otherwise. Packages mentioned only as dependencies should be treated as valid leaf nodes.

Function contract: def has_cyclic_dependencies(imports): accepts dict[str, list[str]] and returns a boolean.

Constraints

0 <= len(imports) <= 1000
Package names are non-empty strings
Each import list contains zero or more package names
A dependency may appear in an import list without being a key in imports
The total number of listed import relationships is at most 10000

Function Signature

def has_cyclic_dependencies(imports):

Your question is Detect Cyclic Package Imports. 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

Implement an algorithm to detect cyclic dependencies in a list of package imports.

Function contract: def has_cyclic_dependencies(imports): accepts dict[str, list[str]] and returns a boolean.

Constraints

0 <= len(imports) <= 1000
Package names are non-empty strings
Each import list contains zero or more package names
A dependency may appear in an import list without being a key in imports
The total number of listed import relationships is at most 10000

Function Signature

def has_cyclic_dependencies(imports):

Your question is Detect Cyclic Package Imports. 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.