<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:
        plen = len(points)

        lines = dict()

        maxp = 1

        for i, p1 in enumerate(points[:-1]):
            x1, y1 = p1[0], p1[1]
            for j in range(i+1, plen):
                p2 = points[j]
                x2, y2 = p2[0], p2[1]

                # Get the slope and intercept tuple
                c = ((x2*y1) - (x1*y2)) / (x2 - x1) if x1 != x2 else x1
                m = (y2-y1) / (x2-x1) if x1 != x2 else 9999999999
                cline = (m,c)
                # print(cline, lines)
                if cline not in lines.keys():
                    lines[cline] = [2, [p1, p2]]
                else:                 
                    if p1 not in lines[cline][1]:   
                        lines[cline][1].append(p1)
                    if p2 not in lines[cline][1]:   
                        lines[cline][1].append(p2)

                    lines[cline][0] = len(lines[cline][1])

                if lines[cline][0] > maxp:
                    maxp = lines[cline][0]

        # print(lines)
        return maxp
            

            
        
32718