PreviousNext
Coding/Graphs and trees

Connect points minimum cost

Write codeMedium30 minAmazon style

Your task

Given a list of points on a 2D plane, the cost to connect two points is the Manhattan distance between them (|x1-x2| + |y1-y2|). Return the minimum total cost to connect all points so that there is exactly one path between any two points (i.e., the minimum spanning tree weight of the complete graph on these points). With 0 or 1 points the cost is 0.

Examples

min_cost_connect_points(points: list[list[int]]) -> int
Example 1
Inputmin_cost_connect_points([[0, 0], [2, 2], [3, 10], [5, 2], [7, 0]])
Output20