<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 ans = 0;
        int p_sz = points.size();
        for(int idx = 0; idx < p_sz; idx++) {
            for(int s_idx = idx + 1; s_idx < p_sz; s_idx++) {
                int x1 = points[idx][0];
                int y1 = points[idx][1];
                int x2 = points[s_idx][0];
                int y2 = points[s_idx][1];
                if(x1 == x2 || y1 == y2) {
                    continue;
                }
                bool hasPt1 = false;
                bool hasPt2 = false;
                for(int np_idx = 0; np_idx < p_sz; np_idx++) {
                    if(points[np_idx][0] == x1 && points[np_idx][1] == y2) {
                        hasPt1 = true;
                    }
                    else if(points[np_idx][0] == x2 && points[np_idx][1] == y1) {
                        hasPt2 = true;
                    }
                }
                if(hasPt1 && hasPt2) {
                    int area = abs(x2 - x1) * abs(y2 - y1);
                    ans = (ans == 0 ? (area) : min(ans, area));
                }
            }
        }
        return ans;
    }
};
23784