<p>You are given an array of points in the <strong>X-Y</strong> plane <code>points</code> where <code>points[i] = [x<sub>i</sub>, y<sub>i</sub>]</code>.</p>

<p>Return <em>the minimum area of a rectangle formed from these points, with sides parallel to the X and Y axes</em>. If there is not any such rectangle, return <code>0</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/08/03/rec1.JPG" style="width: 500px; height: 447px;" />
<pre>
<strong>Input:</strong> points = [[1,1],[1,3],[3,1],[3,3],[2,2]]
<strong>Output:</strong> 4
</pre>

<p><strong class="example">Example 2:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/08/03/rec2.JPG" style="width: 500px; height: 477px;" />
<pre>
<strong>Input:</strong> points = [[1,1],[1,3],[3,1],[3,3],[4,1],[4,3]]
<strong>Output:</strong> 2
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= points.length &lt;= 500</code></li>
	<li><code>points[i].length == 2</code></li>
	<li><code>0 &lt;= x<sub>i</sub>, y<sub>i</sub> &lt;= 4 * 10<sup>4</sup></code></li>
	<li>All the given points are <strong>unique</strong>.</li>
</ul>

class Solution {
public:
    int minAreaRect(vector<vector<int>>& points) {
        unordered_map<int,vector<int>> mp;
        
        for(auto v:points){
            mp[v[0]].push_back(v[1]);
        }
        
        vector<int> v;
        for(auto itr:mp){
            if(itr.second.size()<2)
                continue;
            else{
                v.push_back(itr.first);
                
                vector<int> arr = mp[itr.first];
                sort(arr.begin(),arr.end());
                mp[itr.first]=arr;
            } 
        }
        
        int res=INT_MAX,n=v.size();
        
        for(int i=0;i<n;i++){
            vector<int> v1=mp[v[i]];
            
            for(int j=i+1;j<n;j++){
                vector<int> v2=mp[v[j]];
                vector<int> common;
                
                int v1size=v1.size(),v2size=v2.size(),x=0,y=0;
                
                while(x<v1size && y<v2size){
                    if(v1[x]==v2[y]){
                        common.push_back(v1[x]);
                        x++,y++;
                    }else if(v1[x]>v2[y]){
                        y++;
                    }else{
                        x++;
                    }
                }
                
                if(common.size()>=2){
                    int min_diff=common[1]-common[0];
                    for(int k=2;k<common.size();k++)
                        min_diff=min(min_diff,common[k]-common[k-1]);
                    
                    res=min(res,abs(v[j]-v[i])*min_diff);
                }
            }
        }
        
        return res==INT_MAX?0:res;
    }
};
64165