<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) {
        map<int,vector<int>> xmap, ymap;
        set<vector<int>> pset;
        
        for(int i=0; i<points.size(); i++) {
            xmap[points[i][0]].push_back(i);
            ymap[points[i][1]].push_back(i);
            
            pset.insert(points[i]);
        }
        
        int ans = INT_MAX;
        
        for(int i=0; i<points.size(); i++) {
            vector<int> xvect = xmap[points[i][0]];
            vector<int> yvect = ymap[points[i][1]];
            
            for(int j=0; j<xvect.size(); j++) {
                for(int k=0; k<yvect.size(); k++) {
                    if(xvect[j]==i || yvect[k]==i) {
                        continue;
                    }
                    
                    int x4 = points[yvect[k]][0], y4=points[xvect[j]][1];
                    
                    // cout << i << " " << xvect[j] << " " << yvect[k] << " " << x4 << " " << y4 << endl;
                    
                    if(pset.count(vector<int>{x4,y4}) == 0) {
                        continue;
                    }                    
                    
                    if(x4==points[i][0] || y4==points[i][1]) {
                        continue;
                    }
                    
                    ans = min(ans, abs(x4-points[i][0]) * abs(y4-points[i][1]));
                }
            }
        }
        
        return ans==INT_MAX ? 0 : ans;
    }
};
300684