← Google questions

Critical connections in a network using Tarjan's algorithm

Filed under Google

Find all critical connections (bridges) in an employee network graph using Tarjan's algorithm, where removing an edge disconnects the graph.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Google questions

Collected from public candidate posts and coding forums. Updated Nov 2026.