<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>

from collections import defaultdict, Counter
from math import gcd

def most_frequent_char(lists):
    results = []
    
    for lst in lists:
        if not lst:
            results.append(None)
            continue
        
        char_counts = Counter(lst)
        most_common_char, freq = char_counts.most_common(1)[0]
        results.append(freq)
    
    return results

class Solution:
    def maxPoints(self, points: List[List[int]]) -> int:
        _grads = []
        length = len(points)
        if length == 1:
            return 1
        for p in points:
            x, y =p 
            l = []
            for c in range(length):
                if p != points[c]:
                    x2, y2 = points[c]
                    dy = y - y2
                    dx = x - x2
                    if dx == 0 and dy == 0:
                        grad = 1
                    elif dx != 0:
                        grad = dy / dx
                    else:
                        grad = "0"
                    l.append(grad)
            _grads.append(l)
        print(_grads)
        newmans = max(most_frequent_char(_grads))

        return newmans + 1
        
23455