Deadlock Detection in a Resource Allocation Graph

Detecting deadlock in multi-resource systems using the Banker's Algorithm

This hard coding problem tests your ability to implement a classic operating-system safety check used in GPU-accelerated systems and other environments where multiple processes compete for shared resources. It is the kind of problem that appears in systems-engineering rounds at infrastructure-heavy firms like NVIDIA.

The core challenge is distinguishing between a deadlocked state and a safe one when resource types have multiple instances

• Simulating resource allocation and release
• Greedy search for a safe execution order
• Computing and updating the need matrix
• Distinguishing safe states from unsafe (deadlocked) states