<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) -> int:
        if(len(points) < 2):
            return len(points)

        m_map = {}

        for i in range(len(points)-1):
            p2 = points[i+1]
            # j_to_skip = {}
            for j in range(i+1):
                p1 = points[j]
                m = self.calcGradient(p1, p2)
                
                # if j in j_to_skip:
                #     continue
                
                if (m, j) not in m_map:
                    m_map[(m, j)] = {j, i+1}
                else:
                    m_map[(m, j)] = m_map[(m, j)].union({i+1})

                # j_to_skip = m_map[(m, j)].union(j_to_skip)
            
        return self.getMaxPoint(m_map)

    def getMaxPoint(self, m_map) -> int:
        max_val = -1

        for val in m_map.values():
            # total_points = max(len(list_point) for list_point in val)
            total_points = len(val)
            if total_points > max_val:
                max_val = total_points

        return max_val

    def calcGradient(self, p1, p2):
        x1, y1 = p1
        x2, y2 = p2
        try:
            m = (y2-y1)/(x2-x1)
        except:
            m = 999999
        return m

34570