<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>

#define pii pair<int, int>
class Solution {
public:
    int minAreaRect(vector<vector<int>>& points) {
        sort(points.begin(), points.end());
        map<pii, int> mp;
        int i = 0, j = 0, ans = INT_MAX;
        while(i < points.size()){
            while(j < points.size() && points[i][0] == points[j][0]) j++;
            for(int l = i; l < j; l++){
                for(int m = i+1; m < j; m++){
                    int x = points[l][1], y = points[m][1];
                    if(mp.find(pii(x, y)) != mp.end()){
                        int area = (y - x)*(points[i][0] - mp[pii(x, y)]);
                        if(area > 0) ans = min( ans, area );
                        // cout << x << " " << y << " " << points[i][0] << " " << mp[pii(x, y)] << " " << (y - x)*(points[i][0] - mp[pii(x, y)]) << "\n";
                    }
                    mp[pii(x, y)] = points[i][0];
                }
            }
            // for(auto it : mp){
            //     cout << it.first.first << " " << it.first.second << " " << it.second << " | ";
            // }
            // cout << "\n";
            i = j;
        }
        if(ans == INT_MAX) return 0;
        return ans;
    }
};
237228