<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<pair<int,int>, bool> point_exists;
        map<int, vector<pair<int,int>>> x_array;
        map<int, vector<pair<int,int>>> y_array;

        int min_area = INT_MAX;
        for (int i = 0; i < points.size(); i++) {
            int x = points[i][0];
            int y = points[i][1];

            // Get all points (x1, m)
            vector<pair<int,int>> xarr = x_array[x]; 

            // Get all points (n, y1)
            vector<pair<int,int>> yarr = y_array[y];

            // Check existance of valid rectangles and compare area
            for (int j = 0; j < xarr.size(); j++) {
                for (int k = 0; k < yarr.size(); k++) {
                    if (point_exists[{yarr[k].first, xarr[j].second}]) {
                        int l1 = abs(x - yarr[k].first);
                        int l2 = abs(y - xarr[j].second);
                        int area = l1 * l2;
                        min_area = min(min_area, area);
                    }
                }
            }

            // insert
            point_exists[{x,y}] = true;
            x_array[x].push_back({x,y});
            y_array[y].push_back({x,y});
        }
        if (min_area == INT_MAX) {
            return 0;
        }
        return min_area;
    }
};
69934