Given a 2D integer array, points, where points[i] $= [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:

• $1\leq$ points.length $\leq10$

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

• $-100\leq$ $x_i, y_i$ $\leq100$

• All the points are unique.

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the problem correctly:

We have a game for you to play. Rearrange the logical building blocks to better understand how to solve this problem.

Implement your solution in the following coding playground.