25. Kruskal's Algorithm | Min Cost

PRO

Hard

Topics

Companies

Hint

Open Visualizer

Draw

Input: points = [[0,0],[2,2],[3,10],[5,2],[7,0]]

Output: 20

Explanation: The minimum cost to connect all points is 20.

Input: points = [[3,12],[-2,5],[-4,1]]

Output: 18

Explanation: The minimum cost to connect all points is 18. The edges forming the MST are (3,12)-(-2,5) and (-2,5)-(-4,1).

Time Complexity

O(E log E)

Space Complexity

O(V)