Topic: Backtracking Problem / Level: intermediate

Problem: Find all unique paths in a directed graph where nodes represent tasks that must be completed.

Run the code to see the output here...