Fewest new paths to connect every island
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.
MetaTechnical phone screenNo answer yet. Write the first one; the best answer gets endorsed.