<p>Given an array of <code>points</code> where <code>points[i] = [x<sub>i</sub>, y<sub>i</sub>]</code> represents a point on the <strong>X-Y</strong> plane, return <em>the maximum number of points that lie on the same straight line</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/02/25/plane1.jpg" style="width: 300px; height: 294px;" />
<pre>
<strong>Input:</strong> points = [[1,1],[2,2],[3,3]]
<strong>Output:</strong> 3
</pre>

<p><strong class="example">Example 2:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/02/25/plane2.jpg" style="width: 300px; height: 294px;" />
<pre>
<strong>Input:</strong> points = [[1,1],[3,2],[5,3],[4,1],[2,3],[1,4]]
<strong>Output:</strong> 4
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= points.length &lt;= 300</code></li>
	<li><code>points[i].length == 2</code></li>
	<li><code>-10<sup>4</sup> &lt;= x<sub>i</sub>, y<sub>i</sub> &lt;= 10<sup>4</sup></code></li>
	<li>All the <code>points</code> are <strong>unique</strong>.</li>
</ul>

import numpy as np

class Solution:
    def maxPoints(self, points: List[List[int]]) -> int:
        # Consider two points
        # Then compute the line
        # Then count how many points satisfy that
        
        TOL = 1e-8
        n = len(points)
        if n <= 2:
            return n

        data = np.array(points)
        x = data[:, 0]
        y = data[:, 1]
        max_count = 1
        for i in range(n-1):
            for j in range(i+1, n):
                if x[i] == x[j]:
                    num = np.sum(x == x[i])
                else:
                    slope = (y[j] - y[i]) / (x[j] - x[i])
                    intercept = slope * (-x[i]) + y[i]

                    res = slope * x + intercept - y

                    num = np.sum(abs(res) < TOL)
                if num > max_count:
                    max_count = num

        return max_count
29321