<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) {
        unordered_map<int, vector<vector<int>>> xPoints;
        unordered_map<int, vector<vector<int>>> yPoints;
        map<pair<int,int>, int> xy;
        for(vector<int> &point: points) {
            xPoints[point[0]].push_back(point);
            yPoints[point[1]].push_back(point);
            xy[{point[0], point[1]}] = 1;
        }

        long minArea = LONG_MAX;

        for(vector<int> &point: points) {
            int x = point[0];
            int y = point[1];

            for(vector<int> &xPoint: xPoints[x]) {
                int y1 = xPoint[1];
                for(vector<int> &yPoint: yPoints[y1]) {
                    int x1 = yPoint[0];
                    if(xy[{x1, y}]) {
                        long area = abs(y-y1)*abs(x-x1)*1L;
                        if(area)
                            minArea = min(minArea, area);
                    }
                }
            }
        }

        return minArea == LONG_MAX ? 0 : minArea;

    }
};
35321