<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>>mp;
        for(auto it:points){
            mp[it[0]].insert(it[1]);
        }
        vector<pair<int,set<int>>>vec;
        for(auto it:mp){
            // vector<int>temp={it.second.begin(),it.second.end()};
            vec.push_back({it.first,it.second});
        }
        int ans=INT_MAX;
        for(int i=0;i<vec.size()-1;i++){
            for(int j=i+1;j<vec.size();j++){
                int l1=vec[i].first,l2=vec[j].first;
                
                set<int>s1=vec[i].second;
                set<int>s2=vec[j].second;
                vector<int>curr;
                // cout<<s1.size()<<" "<<s2.size()<<endl;
                for(auto it:s1){
                    if(s2.find(it)!=s2.end()) curr.push_back(it);
                }
                // cout<<curr.size()<<endl;
                int size=curr.size();
                // if(curr.size()==0) continue;
                for(int k=0;k<size-1;k++){
                    ans=min(ans,abs(l1-l2)*abs(curr[k]-curr[k+1]));
                }
            }
            
        }
        return ans==INT_MAX ? 0 : ans;

    }
};
369909