<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 ans = INT_MAX;
    void min_area(int a,int b,vector<int> & ya,vector<int> & yb){

        map<int,int> m;
        for(auto it:yb){
            m[it] = 1;
        }
        int n = ya.size();
        
        for(int i = 0;i<n;i++){
            for(int j = i + 1;j< n ;j++){
                if(m[ya[i]] == 1 and m[ya[j]]){
                        int area = (abs(a - b) * abs(ya[i] - ya[j]));
                        ans = min(ans,area);
                }
            }
        }

    }
    int minAreaRect(vector<vector<int>>& points) {
        vector<int> x,y;
        set<int> s;
        map<int,vector<int>> m;
        for(auto it:points){
            s.insert(it[0]);
            
            y.push_back(it[1]);
            m[it[0]].push_back(it[1]);

        }
        x = {s.begin(),s.end()};

        int n = x.size();
        for(int i = 0;i<n;i++){
            for(int j = i+1;j<n;j++){
                if(m[x[i]].size() <2 or m[x[j]].size() <2){
                    continue;
                }
                min_area(x[i],x[j],m[x[i]],m[x[j]]);
            }
        }
        if(ans == INT_MAX) return 0;
     return ans;
    }
};
81471