← Amazon questions

Minimum edges to make graph strongly connected

Filed under Amazon

Given a directed graph with $n$ nodes and $e$ edges, find the minimum number of edges that must be added to make the graph strongly connected.

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 Amazon questions

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