<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 area = INT_MAX;
        unordered_map<int, vector<int>> xCoord;
        unordered_map<int, vector<int>> yCoord;
        unordered_map<string, int> isPresent;
        for(int i=0; i<points.size(); i++){
            int x = points[i][0], y = points[i][1];
            string key = to_string(x) + "#" + to_string(y);
            xCoord[x].push_back(y);
            yCoord[y].push_back(x);
            isPresent[key] = 1;
        }

        for(int i=0; i<points.size(); i++){
            int x = points[i][0], y = points[i][1];
            vector<int> xAxis = xCoord[x];
            vector<int> yAxis = yCoord[y];
            for(int j=0; j<xAxis.size(); j++){
                for(int k=0; k<yAxis.size(); k++){
                    if(xAxis[j] != y && yAxis[k] != x){
                        string key = to_string(yAxis[k]) + "#" + to_string(xAxis[j]);
                        if(isPresent[key] == 1){
                            area = min(area, (abs(x-yAxis[k])*abs(y-xAxis[j])));
                        }
                    }
                }
            }
        }
        return area == INT_MAX ? 0 : area;
    }
};
69934