DevOps Coding Problem | Dataford Interview Questions

Solve a coding problem that involves data structures or algorithms relevant to DevOps tasks.

Implement has_dependency_cycle(dependencies) to determine whether a directed dependency graph contains a cycle. Each key is a service or deployment component, and its value lists components that must be deployed before it. Return True if any cycle exists, otherwise return False.

The input is a dictionary of strings to lists of strings. Components mentioned only as dependencies are valid vertices. Use the function signature def has_dependency_cycle(dependencies):.

Constraints

0 <= number of declared components <= 1000
Each component name is a non-empty string
Each dependency list contains strings
A dependency may appear only as a value and need not be a dictionary key
The graph may contain disconnected components

Function Signature

def has_dependency_cycle(dependencies):

Your question is DevOps Coding Problem. 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

Solve a coding problem that involves data structures or algorithms relevant to DevOps tasks.

The input is a dictionary of strings to lists of strings. Components mentioned only as dependencies are valid vertices. Use the function signature def has_dependency_cycle(dependencies):.

Constraints

0 <= number of declared components <= 1000
Each component name is a non-empty string
Each dependency list contains strings
A dependency may appear only as a value and need not be a dictionary key
The graph may contain disconnected components

Function Signature

def has_dependency_cycle(dependencies):

Your question is DevOps Coding Problem. 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.