<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) {
        int n = points.size();
        unordered_map<int, unordered_map<int, int>> hash;
        int minarea = INT_MAX;
        for(auto& p : points){
            hash[p[0]][p[1]] = 1;
        }
        sort(points.begin(), points.end(), [](vector<int> x, vector<int> y){ return x[0] < y[0]; });
        for(int i = 0; i < n; ++i){
            auto& p = points[i];
            for(int j = i+1; j < n; ++j){
                auto& q = points[j];
                if(p[0] == q[0] || p[1] == q[1]) continue;
                else if(hash[p[0]][q[1]] && hash[q[0]][p[1]]){
                    minarea = min(minarea, abs(q[0] - p[0])* abs(q[1] - p[1]));
                }
            }
        }
        return minarea == INT_MAX ? 0 : minarea;
    }
};
41090