Minimum spanning tree Manhattan
You must lay cable connecting n sensor nodes positioned on a 2D plane so the whole set is connected. The cost to directly connect two nodes is the Manhattan distance |x1-x2| + |y1-y2| between them. Given `points` as a list of [x, y], return the minimum total cost to connect all nodes. If there are 0 or 1 nodes, the cost is 0.
Implement
min_connect_points(points: list[list[int]]) → intExamples
in
[[[0,0],[2,2],[3,10],[5,2],[7,0]]]out20What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 30 min
solution.py
InputExpectedGot
[[[0,0],[2,2],[3,10],[5,2],[7,0]]]20not run yetsample