<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>>& a) {
        int ans = INT_MAX;
        int n = a.size();

        map<vector<int>, int> pointsMap;
        for(auto &pts: a){
            pointsMap[{pts[0], pts[1]}]++;
        }
        for(int i = 0; i < n; i++){
            for(int j = i+1; j < n; j++){
                int ai0 = a[i][0];
                int ai1 = a[i][1];
                int aj0 = a[j][0];
                int aj1 = a[j][1];
                
                if(ai0 == aj0 || ai1 == aj1) continue;
                if(ai0>aj0){
                    swap(ai0, aj0);
                    swap(ai1, aj1);
                }

                if(pointsMap[{aj0, ai1}] && pointsMap[{ai0, aj1}]){
                    ans = min(ans, abs(((aj1-ai1)*(aj0-ai0))));
                }
            }
        }
        
        return (ans == INT_MAX ? 0: ans);
    }
};
231459