<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:
        #calculate sllope y = mx + b b = y-mx
        m = {}
        for i in range(len(points)):
            one = points[i]
            for j in range(i, len(points)):
                if j == i:
                    continue
                else:
                    two = points[j]
                    if (one[1] == two[1]):
                        slope = 0
                        b = one[1]
                    elif (one[0] == two[0]):
                        slope = "undefined"
                        b = one[0]
                    else:
                        slope = (one[1] - two[1])/(one[0] - two[0])
                        b = one[1] - (one[0]*slope)
                    if (slope, b) not in m:
                        m[(slope, b)] = []
                    if one not in m[(slope, b)]:
                        m[(slope, b)].append(one) 
                    if two not in m[(slope, b)]:
                        m[(slope, b)].append(two)
        c = [len(v) for v in m.values()]
        print(m)
        if not c:
            return 1
        return max(c)
                    



            
        
36114