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

        map<int,set<int>>mpx;

        for(auto &  it: points){
            mpx[it[0]].insert(it[1]);
        }
        int mn=INT_MAX;

        for(auto & it1 :mpx){
            for(auto & it2:mpx){

                if(it1.first==it2.first || it1.second.size()<=1 || it2.second.size()<=1){
                    continue;
                }

                vector<int>temp;
                for(auto & it3 : it1.second){
                    temp.push_back(it3);
                }

                int n=temp.size();

                for(int i=0;i<n;i++){
                    for(int j=i+1;j<n;j++){
                        if(it2.second.find(temp[i])!=it2.second.end()  && it2.second.find(temp[j])!=it2.second.end()){
                            int len=abs(it1.first-it2.first);
                            int wd=abs(temp[i]-temp[j]);
                            mn=min(mn,len*wd);
                            // cout<<it1.first<<" "<<it2.first<<" "<<temp[i]<<" "<<temp[j]<<endl;
                        }
                    }
                }



            }
        }   

        if(mn==INT_MAX)  return 0;
        return mn;
    }
};
81471