<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<int, vector<int>> mapx{};
        map<int, vector<int>> mapy{};

        for(auto p : points)
        {
            mapx[p[0]].emplace_back(p[1]);
            mapy[p[1]].emplace_back(p[0]);
        }
        int ans = INT_MAX;

        for(auto [x1,y_vals] : mapx)
        {
            for(int y1 = 0; y1 < y_vals.size(); y1++)
            {
                for(int y2 = y1+1; y2 < y_vals.size(); y2++)
                {
                    for(int x2_1 : mapy[y_vals[y2]])
                    {
                        for(int x2_2 : mapy[y_vals[y1]])
                        {
                            if(x2_1 == x2_2 and x2_1 != x1)
                            {
                                //cout << "Huehuehue" << endl;
                                ans = min(ans, abs(x2_1 - x1) * abs(y_vals[y2] - y_vals[y1]));
                            }
                        }
                    }
                }
            }
        }

        return ans == INT_MAX ? 0 : ans;
    }
};
29553