← Questions
Fewest new paths to connect every island
0
I was asked this
No reports yet. Sign in to say where you were asked it.
You have N named islands and a list of existing two-way paths between them. Return the fewest new paths needed so every island can reach every other: count the connected components with union-find or a graph search, and the answer is that count minus one.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding