<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:
        result = 1

        if len(points) == 1:
            return result

        inf = 'I'
        NA = 'N'
        arrayOfArrayOfSlopes = []
        for i in range(0, len(points)):
            arrayOfSlopes = []
            for j in range(0, i):
                p1 = points[j]
                x1, y1 = p1[0], p1[1]
                p2 = points[i]
                x2, y2 = p2[0], p2[1]

                if x1 == x2:
                    arrayOfSlopes.append(inf)
                else:
                    arrayOfSlopes.append((y2 - y1) / (x2 - x1))
            arrayOfArrayOfSlopes.append(arrayOfSlopes)

        for i in range(0, len(points)):
            arrayOfSlopes = []
            for j in range(0, len(points)):
                if i > j :
                    arrayOfSlopes.append(arrayOfArrayOfSlopes[i][j])
                elif i < j:
                    arrayOfSlopes.append(arrayOfArrayOfSlopes[j][i])
                elif i == j:
                    arrayOfSlopes.append(NA)
            c = collections.Counter(arrayOfSlopes)
            freq = c.most_common(1)

            result = max(freq[0][1] + 1, result)

        return result

17898