<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 area(vector<int> first, vector<int> second, vector<int> third, 
    set<pair<int,int>> sortedPoints) {
        auto fourth = vector<int>{third[0], second[1]};
        if (sortedPoints.find({fourth[0], fourth[1]}) != sortedPoints.end()) {
            return (third[0]-first[0]) * (second[1]-first[1]);
        }

        return INT_MAX;
    }

    int minAreaRect(vector<vector<int>>& points) {
        
        set<pair<int,int>> sortedPoints;
        
        for(auto point : points) {
            sortedPoints.insert({point[0], point[1]});
        }

        int ans = INT_MAX;

        for(auto it = sortedPoints.begin(); it != sortedPoints.end(); it++) {
            auto first = vector<int>{it->first, it->second};
            for(auto secondIt=next(it); secondIt != sortedPoints.end(); secondIt++) {
                auto second = vector<int>{secondIt->first, secondIt->second};
                if(first[1] >= second[1] || first[0] >= second[0]) {
                    continue;
                }

                if(sortedPoints.find({first[0], second[1]}) != sortedPoints.end() &&
                sortedPoints.find({second[0], first[1]}) != sortedPoints.end()) {
                    ans = min(ans, (second[0]-first[0])*(second[1]-first[1]));
                }
            
            }
        }
        if(ans == INT_MAX) {
            return 0;
        }
        return ans;
    }
};
306453