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

        std::set<std::vector<int>> pointSet;
        int minArea = INT_MAX;

        for(int i=0; i<points.size(); ++i){
            pointSet.insert(points[i]);
            if(pointSet.size() < 4){
                continue; 
            }
            int x1 = points[i][0];
            int y1 = points[i][1];
            for(auto &cord : pointSet){
                int x2 = cord[0];
                int y2 = cord[1];
                if(x2 != x1 && y2 != y1){
                   std::vector<int> match1 = {x2,y1};
                   std::vector<int> match2 = {x1,y2};
                   if(pointSet.count(match1) && pointSet.count(match2)){
                        minArea = std::min(minArea, std::abs(x1-x2) * std::abs(y2-y1));
                   }
                }
            }
        }
        if(minArea == INT_MAX){
            minArea = 0;
        }
        return minArea;
        
    }
};
271840