Graph Coding Challenges
Explore graph algorithms: DFS, BFS, shortest paths, minimum spanning trees, and topological sorting by solving Graph coding challenges.
Problems (17 total)
Mountain Cabin Signal Range
Count how many mountain cabins receive a signal when bridges in the valley are snowed in.
Seaport Ferry Gate Control
Count how many ferry gates remain reachable when the harbor closes selected docks.
City Bus Loop Access
Determine how many bus stops remain reachable when certain loop stations are temporarily closed.
Railway Network Delay Optimizer
Compute the fastest train route when select track penalties can be waived.
Harbor Signal Expansion Test
Assess how far harbor alerts travel when lighthouses are under maintenance.
Interstate Rescue Network Audit
Determine how many service depots remain reachable when a list of highways is closed.
Disaster Relief Route Tracker
Track how many shelters are reachable by relief convoys when roads are blocked.
Wildlife Bridge Network Scan
Estimate how many migration bridges stay reachable when some crossings close for repairs.
Metro Transfer Capacity Map
Count how many metro stations receive an alert when certain stops are suspended.
Riverside Power Grid Check
Calculate substations reachable during a maintenance check across power lines.
Campus Shuttle Loop Coverage
Determine rooms reached by a shuttle loop without revisiting a stop.
Harbor Ferry Route Planner
Count docks reached within a capped number of ferry transfers.