<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:
        if len(points)<2:
            return 1
        line={}
        m=0
        for i in range(len(points)):
            for j in range(i+1,len(points)):
                slope=float('inf')
                
                if(points[j][0]-points[i][0]!=0):
                    slope=(points[j][1]-points[i][1])/(points[j][0]-points[i][0])
                    c=points[j][1]-slope*points[j][0]
                else:
                    c=points[j][0]
                mix=str(slope)+str(c)
                if mix in line:
                    if points[j] not in line[mix]:
                        line[mix].append(points[j])
                    if points[i] not in line[mix]:
                        line[mix].append(points[i])
                else:
                    line[mix]=[points[j],points[i]]
        for i in line.keys():
            if len(line[i])>m:
                m=len(line[i])
        return m
26851