How should I practice Max Points on a Line?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Uber phone screen problems in FastPrep.

Is Max Points on a Line associated with Uber?

FastPrep tags this as a Uber phone screen coding practice problem when the problem catalog has that company and stage context.

Uber● HardFULLTIMEPHONE SCREEN

Given an array points of distinct two-dimensional integer points, return the largest number of input points that lie on one straight line.

Each row is [x, y]. Vertical and horizontal lines are allowed. A single point gives an answer of 1.

maxPoints(points: int[][]) → int

points = [[0,0],[1,1],[-1,-1],[2,2],[-2,-2],[0,2]]return = 5

The points [-2,-2], [-1,-1], [0,0], [1,1], and [2,2] lie on y = x. The remaining point [0,2] is off that line. Thus the maximum is 5.

points = [[2,-3],[2,0],[2,4],[0,0]]return = 3

The three points whose x coordinate is 2 lie on the vertical line x = 2. The fourth point is off it, so the maximum is 3.

points = [[0,0],[1,0],[0,1]]return = 2

No straight line contains all three vertices of this triangle. Any two points share a line, so the maximum is 2.

1 <= points.length <= 300.
points[i].length == 2.
-10000 <= points[i][j] <= 10000.
No two points have the same pair of coordinates.
These numeric and distinct-point restrictions are explicit practice assumptions.