Dunzo Critical Delivery Road Bridges
Dunzo Critical Delivery Road Bridges
HardGraphs0% accepted
Dunzo delivery network has roads. A bridge is a road whose removal disconnects the network. Given n nodes and edges, find all critical connections (bridges). Losing a bridge road cuts off deliveries.
Approach
Find all bridges (critical edges) in an undirected graph using Tarjan algorithm.
Input
4 4
0 1
1 2
2 0
1 3
Output
[[1,3]]
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