<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) {
        int n=points.size(),i,j;

        sort(points.begin(),points.end());

        map<pair<int,int>,vector<int>>mp;

       for(i=0;i<n;i++)
       {
        for(j=i+1;j<n;j++)
        {
            if(points[i][0] == points[j][0])
            {

                mp[{points[i][1],points[j][1]}].push_back(points[i][0]);
            }
        }
       }
       int ans = 1e9;

       for(auto v:mp)
       {
        sort(v.second.begin(),v.second.end());
        int len = abs(v.first.first - v.first.second);
        for(i=0;i<v.second.size()-1;i++)
        {
            int area = len*(v.second[i+1]-v.second[i]);
            ans = min(ans,area);
        }
       }

       if(ans == 1e9)return 0;

       return ans;


    }
};
341065