<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) {
        std::unordered_map<int, std::set<int>> m;
        for (auto point : points) {
            m[point[0]].insert(point[1]);
        }
        int min = INT_MAX;
        for (int i = 0; i < points.size(); i++) {
            std::vector<int> point1 = points[i];
            for (int j = i+1; j < points.size(); j++) {
                std::vector<int> point2 = points[j];
                if (point1[0] == point2[0] || point1[1] == point2[1]) {
                    continue;
                }
                if (m[point1[0]].find(point2[1]) != m[point1[0]].end() && 
                    m[point2[0]].find(point1[1]) != m[point2[0]].end()) {
                        min = std::min(min, std::abs(point1[0]-point2[0])*std::abs(point1[1]-point2[1]));
                }
            }
        }
        if (min == INT_MAX) return 0;
        return min;
    }
};
317990