<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 haveDoubleCommonPoints(vector<int>& first, vector<int>& second) {
        int i = 0, j = 0;
        vector<int> common;
        while(i < first.size() and j < second.size()) {
            if(first[i] < second[j]) {
                i++;
            }
            else if(first[i] > second[j]) {
                j++;
            }
            else {
                common.push_back(first[i]);
                i++;
                j++;
            }
        }
        if(common.size() < 2) return 0;
        int minDistance = INT_MAX;
        for(int i = 0; i < common.size() - 1; ++i){
            minDistance = std::min(common[i+1] - common[i], minDistance);
        }
        return minDistance;
    }
    int minAreaRect(vector<vector<int>>& points) {
        std::unordered_map<int, vector<int>> xPoints;
        unordered_set<int> xValSet;
        for(const auto& point : points){
            xPoints[point[0]].push_back(point[1]);
            xValSet.insert(point[0]);
        }
        for(auto& it : xPoints) {
            sort(it.second.begin(), it.second.end());
        }
        vector<int> xVals;
        for(auto val : xValSet) {
            xVals.push_back(val);
        }
        sort(xVals.begin(), xVals.end());
        int minArea = INT_MAX;
        for( int i = 0; i < xVals.size() - 1; ++i){
            int xVal1 = xVals[i];
            for(int j = i+1; j < xVals.size(); ++j){
                int xVal2 = xVals[j];
                int minLength = haveDoubleCommonPoints(xPoints[xVal1], xPoints[xVal2]);
                if(minLength != 0) {
                    minArea = std::min(minArea, minLength * (xVal2 - xVal1));
                }              
            }
        }
        if(minArea == INT_MAX) {
            return 0;
        }
        return minArea;

    }
};
93009