PhonePe Transaction Cycle Detection
PhonePe Transaction Cycle Detection
MediumGraphs100% accepted
PhonePe models transaction dependencies as a directed graph. A cycle in dependencies means a deadlock. Given n nodes and directed edges, detect if any cycle exists in the directed graph.
Approach
Detect cycle in a directed graph using DFS with recursion stack coloring.
Input
4
0 1
1 2
2 3
Output
false
More Graphs problems
Browse all coding problems →solution.py
Loading editor...
Test 1
Test 2
Test 3
Press Run to test your custom input, or Submit to judge against all test cases.
Sign in to continue
Create a free account to run code, submit solutions and track progress.
- Free forever — no credit card
- 10+ languages with live execution
- Points, streaks & leaderboards