Gamified challenge · Minimum spanning tree
There are n villages, 0 to n - 1. Each entry [u, v, cost] of roads is a road you could build between villages u and v (two-way). Choose roads so that every village can reach every other, paying as little as possible in total.
Write minRoads(n, roads) that returns that minimum total cost, or -1 if the villages can't all be connected. One village needs no roads: 0.
Example: n = 5, roads [[0,1,4],[0,2,3],[1,2,1],[1,3,2],[2,3,4],[3,4,2],[2,4,6]]. Build 1-2 (1), 1-3 (2), 3-4 (2) and 0-2 (3) for 8.
This game is part of the paid plans. Sign in, then pick a plan to write your answer, watch it play out, and step through the algorithm with its guide.
Sign in with Google