<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>

class Solution:
    def maxPoints(self, points: List[List[int]]) -> int:
        n = len(points)
        m=0
        d=[[0]*n for _ in range(n)]
        if len(points)==1:
            return 1
        for i in range(0,n):
            def dfs(j,p_2):
                visited.add(j)
                count =1
                x1,y1 = points[p_2[0]]
                x2,y2 = points[p_2[1]]
                for k in range(0,n):
                    if k not in visited and d[p_2[0]][k]==0 and  d[p_2[1]][k]==0:
                        x3, y3=points[k]
                        if (y2 - y1) * (x3 - x1) == (y3 - y1) * (x2 - x1) :
                            # print(points[k], end=" | ")  
                            count += dfs(k, p_2)
                print(count)
                return count
            
            for j in range(0,n):
                if j!= i:
                    d[i][j]=1
                    c=1
                    visited = set()
                    p_2=[i,j]
                    visited.add(i)
                    c += dfs(j,p_2)
                    m = max(c,m)
                
        return m
17280