<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<vector<int>,bool> mat;
        map<int,vector<int>> x;
        map<int,vector<int>> y;
        for(auto i:points) {
            mat[{i[0],i[1]}] = 1;
            x[i[0]].push_back(i[1]);
            y[i[1]].push_back(i[0]);
        }
        int area = 0;
        for(auto i:x){
            int x1 = i.first;
            vector<int> v = i.second;
            if(v.size()<2) continue;
            for(int n=0; n<v.size(); n++){
                for(int m=n+1; m<v.size(); m++){
                    int y1 = v[n];
                    int y2 = v[m];
                    for(auto x2:y[y1]){
                        if(x2!=x1){
                            if(mat[{x2,y2}]){
                                int temparea = abs(x1-x2)*abs(y1-y2);
                                area = area==0?temparea:min(area,temparea);
                            }
                        }
                    }
                }
            }
        }
        return area;
    }
};
150696