<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,vector<int>> xaxis,yaxis;
        set<pair<int,int>> st;
        for(auto it : points) st.insert({it[0],it[1]});
        for(auto it:points) xaxis[it[0]].push_back(it[1]);
        for(auto it:points) yaxis[it[1]].push_back(it[0]);
        // cout<<xaxis.size()<<yaxis.size()<<endl;
        int ans=INT_MAX;
        for(auto it:points){
            int x = it[0];
            int y = it[1];
            for(auto a:xaxis[x]){
                    for(auto b:yaxis[y]){
                            // cout<<x<<" "<<y<<" "<<b<<" "<<a<<endl;
                            if(a!=y && b!=x){
                                if(st.find({b,y})!=st.end() && st.find({x,a})!=st.end() &&st.find({b,a})!=st.end()){
                                // cout<<x<<" "<<y<<" "<<b<<" "<<a<<endl;
                                int temp  = abs(b-x)*abs(a-y);
                                ans=min(ans,temp);
                            }
                            }
                    }
            }
        }
        if(ans==INT_MAX) return 0;
        return ans;
    }
};
35321