Top 150 InterviewEasy

Min Cost to Connect All Points

Detailed guide and Python implementation for the 'Min Cost to Connect All Points' problem.

Problem Statement

Easy

You are given an array points representing integer coordinates of some points on a 2D-plane, where points[i] = [xi, yi].

The cost of connecting two points [xi, yi] and [xj, yj] is the Manhattan distance between them: |xi - xj| + |yi - yj|, where |val| is the absolute value of val.

Return the minimum cost to make all points connected. All points are connected if there is exactly one simple path between any two points.

Write a function minCostConnectPoints(points: List[List[int]]) -> int.

Constraints
  • 1 <= len(points) <= 1000
  • -10^6 <= xi, yi <= 10^6
  • All points are distinct

Examples

Example 1
Input
points = [[0,0],[2,2],[3,10],[5,2],[7,0]]
Output
20
Explanation

Connect points as: (0,0)-(2,2) cost 4, (2,2)-(5,2) cost 3, (5,2)-(7,0) cost 4, (2,2)-(3,10) cost 9. Total = 20.

Example 2
Input
points = [[3,12],[-2,5],[-4,1]]
Output
18
Explanation

Connecting points: (-4,1) to (-2,5) with cost 6, (-2,5) to (3,12) with cost 12. Total 18.

Need a Hint?
Consider using Advanced Graphs-specific data structures like sets or heaps.
Edge Cases to Watch
  • Empty input structures
  • Single element inputs
  • Large numerical bounds

Ready to Solve?

Open the problem in PyRun's browser-based Python editor. Your code runs fully offline — no server required.

Open in Editor

Recommended Python Resources

Expand your knowledge with related interactive tutorials, cheat sheets, and code comparisons.