Day-29 : Q2- Min Cost to Connect All Points

[Mansi8874]

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| denotes 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.

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

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

Constraints: 1 <= points.length <= 1000 -106 <= xi, yi <= 106 All pairs (xi, yi) are distinct.

[Shubh-Krishna]

please assign me this question :) @bh-g

[avanimathur]

Please assign it to me @bh-g @kratika-Jangid

[Kalpana8055]

@bh-g @kratika-Jangid pls assign to me

[Tech-neophyte]

@bh-g @kratika-Jangid pls assign the ques to me

[Anomasingh]

Please assign this question to me.. @bh-g