Given an integer array of points where $\text{points}[i] = [x_i, y_i]$ represents a point on the X–Y plane, your task is to return the maximum number of points on the same straight line.

Constraints:

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

• points[i].length $= 2$

• $-10^4 \leq x_i, y_i \leq 10^4$

• All the points are unique.