Smart Pointers and Deadlock | Dataford Interview Questions

Tell me about smart pointers and deadlock in embedded software.

Given a directed dependency graph of n components, each component either owns another component through a smart pointer or waits on a lock held by another component. Return true if the dependency graph contains a cycle that can lead to deadlock, otherwise return false.

Input

n: number of components, labeled 0 to n - 1
edges: list of directed pairs [u, v], meaning component u depends on component v

Output

Return a boolean.

Constraints

1 <= n <= 10^5
0 <= len(edges) <= 2 * 10^5
0 <= u, v < n
Self-loops count as cycles

Function Signature

def has_deadlock_cycle(n, edges):

Your question is Smart Pointers and Deadlock. 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