<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>>x_axis;
       unordered_map<int,set<int>>y_axis;


       for(int i=0;i<points.size();i++)
       {
           x_axis[points[i][0]].push_back(points[i][1]);
           y_axis[points[i][1]].insert(points[i][0]);
       }
        int min1=1e9;
        for(unordered_map<int,vector<int>>::iterator it=x_axis.begin();it!=x_axis.end();it++)
        {
            vector<int>ypoints=it->second;
            for(int i=0;i<ypoints.size();i++)
            {
                for(int j=0;j<i;j++)
                {
                    int a_y=ypoints[i];
                    int b_y=ypoints[j];
                    set<int>aset=y_axis[a_y];
                    set<int>bset=y_axis[b_y];
                    if(a_y==b_y )
                        continue;
                    for(set<int>::iterator it1=aset.begin();it1!=aset.end();it1++)
                    {
                        if(bset.find((*it1))!=bset.end())
                        {
                            if(abs((*it1)-it->first)>0)
                            min1=min(min1,abs((*it1)-it->first)*abs(a_y-b_y));
                            
                        }
                    }
                }
            }
        }
        // cout<<min1<<endl;
        if(min1==1e9)
            return 0;
        return min1;
    }
    

    
};
375678