<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, set<int>> m;

        for (const auto& p : points) {
            int x = p[0], y = p[1];
            m[x].insert(y);
        }

        int min_area = INT_MAX;
        for (auto i = m.begin(); i != m.end(); i++) {
            for (auto j = next(i); j != m.end(); j++) {
                auto& [x1, s1] = *i;
                auto& [x2, s2] = *j;
                if (s1.size() < 2  || s2.size() < 2) continue;

                vector<int> y;
                set_intersection(s1.begin(), s1.end(), s2.begin(), s2.end(), back_inserter(y));

                for (int k = 1; k < y.size(); k++) {
                    min_area = min(min_area, abs(x1 - x2) * abs(y[k] - y[k - 1]));
                } 
            }

        }

        if (min_area < INT_MAX) return min_area;

        return 0;
    }
};
52628