Loading your interview setup

Skip to content

Overview Resume Score

Practice

The Daily LarpCode Reps LarpTalk

Interview

Templates Sessions

recent

Loading

medium· advanced-graphs Mock interview

Min Cost to Connect All Points

Given `points` on a 2D plane, the cost to connect two points is their Manhattan distance |x1-x2| + |y1-y2|. Return the minimum total cost to connect all points so that every pair is reachable.

Examples

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

out: 20

minimum spanning tree weight

Constraints

1 <= len(points) <= 1000
-10^6 <= x, y <= 10^6

Hints

target: O(n^2) time⌘↩ run · ⇧⌘↩ submit