Detect resource deadlock
Detect deadlock from a resource wait-for graph. You are given a list of [holder, waiter] edges meaning the `waiter` thread is blocked waiting on a resource currently held by the `holder` thread. A deadlock exists iff this directed graph contains a cycle. Return True if any cycle exists, otherwise False. Thread identifiers are arbitrary hashable values (ints).
Implement
has_deadlock(edges: list[list[int]]) → boolExamples
in
[[[1,2],[2,3],[3,1]]]outtrueWhat a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 35 min
solution.py
InputExpectedGot
[[[1,2],[2,3],[3,1]]]truenot run yetsample