<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 (int i = 0; i < points.size(); i++) {
            m[points[i][0]].insert(points[i][1]);
        }

        int area = INT_MAX;
        unordered_map<int, set<int>>::iterator it1, it2;
        for (it1 = m.begin(); it1 != m.end(); it1++) {
            for (it2 = next(it1); it2 != m.end(); it2++) {
                vector<int> intersect;
                set_intersection(it1->second.begin(), it1->second.end(),
                                 it2->second.begin(), it2->second.end(),
                                 back_inserter(intersect));
                for (int i = 1; i < intersect.size(); i++) {
                    area = min(area,
                               abs(it1->first - it2->first) * (intersect[i] - intersect[i-1]));
                }
            }
        }

        return area == INT_MAX ? 0 : area;
    }
};
98778