<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, map<int, int> > mmp;
        for(int i=0;i<points.size();i++){
            mmp[points[i][0]][points[i][1]]++;
        }
        
        int ans=INT_MAX;
        map<int, int>mid;
        for(auto it=mmp.begin();it!=mmp.end();it++){
            map<int, int>val = it->second;
            auto it1=it;
            it1++;
            mid.clear();
            for(;it1!=mmp.end();it1++){
                map<int, int>val1=it1->second;
                mid.clear();
                for(auto i=val1.begin();i!=val1.end();i++){
                    if(val.find(i->first)!=val.end()){
                        mid[i->first]++;
                    }
                }
                if(mid.size()<=1){
                    continue;
                }
                auto i=mid.begin();
                int prev=i->first;
                i++;
                for(;i!=mid.end();i++){
                    ans=min(ans, (i->first-prev)*(it1->first-it->first));
                    prev=i->first;
                    //cout<<ans<<" "<<i->first<<" "<<prev<<" "<<it1->first<<" "<<it->first<<endl;
                }
            }
        }
        if(ans==INT_MAX){
            return 0;
        }
        return ans;
    }
};
335296