<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 {
public:
struct VectorCompare{
    bool operator()(const vector<int>& a,const vector<int>& b) const{
        if(a[0]==b[0]){
            return a[1]<b[1];
        }
        else{
            return a[0]<b[0];
        }
    }
};
    int maxPoints(vector<vector<int>>& points) {
        int mx = 1;
       
        for(int i=0;i<points.size();i++){
             map<double,set<vector<int>,VectorCompare>> mp;
            for(int j=i+1;j<points.size();j++){
                if(points[i][0] == points[j][0] ){
                    mp[INT_MIN].insert(points[i]);
                    mp[INT_MIN].insert(points[j]);
                }
                else{
                    double slope = (points[j][1]-points[i][1])/(double)(points[j][0]-points[i][0]);
                    mp[slope].insert(points[j]);
                    mp[slope].insert(points[i]);
                }
            }
    for(auto i:mp){
            mx= max(mx,(int)i.second.size());
        }
        }
        
    
        return mx;

        // map<float,int> mp;
        // for(int i=0;i<points.size();i++){
        //     for(int j=i+1;j<points.size();j++){
        //         if(points[i][0]==points[j][0]){
        //             mp[INT_MIN]++;
        //         }
        //         else{
        //             float slope = (points[j][1]-points[i][1])/(float)(points[j][0]-points[i][0]);
        //             mp[slope]++;
        //         }
        //     }
        // }
        // int mx = 1;
        // for(auto i:mp){
        //     mx = max(mx,i.second+1);
        // }
        // return mx;
    }
};
63268