Minimum Number of Lines to Cover Points

Try to solve the Minimum Number of Lines to Cover Points problem.

Statement

Given a 2D integer array, points, where points[i] =[xi,yi]= [x_i,y_i] represents a point on an XY plane, find the minimum number of straight lines required to cover all the points.

Note: Straight lines will be added to the XY plane to ensure that every point is covered by at least one line.

Constraints:

  • 11\leq points.length 10\leq10

  • points[i].length ==2== 2

  • 100-100\leq xi,yix_i, y_i 100\leq100

  • All the points are unique.

Examples

Level up your interview prep. Join Educative to access 70+ hands-on prep courses.