<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 lineEq(self, point1: list[int], point2: list[int]) -> str:
        if point2[0] == point1[0]:
            return f"x{point1[0]}"

        elif point2[1] == point1[1]:
            return f"y{point1[1]}"

        slope = (point2[1] - point1[1]) / (point2[0] - point1[0])
        intercept = point1[1] - slope * point1[0]

        if intercept >= 0:
            return f"{slope}x + {intercept}"
        else:
            return f"{slope}x - {abs(intercept)}"

    def maxPoints(self, points: list[list[int]]) -> int:
        if len(points) == 1:
            return 1
        slops = {}
        max: int = 0
        for i in range(0, len(points)):
            for j in range(0, len(points)):
                if j == i:
                    continue
                key: str = self.lineEq(points[i], points[j])
                if key not in slops:
                    slops[key] = [points[j]]
                elif points[j] not in slops[key]:
                    slops[key].append(points[j])

                if points[i] not in slops[key]:
                    slops[key].append(points[i])

        for slop in slops:
            if max < len(slops[slop]):
                max = len(slops[slop])
        return max
30865