<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:
    bool static compare(vector<int> a, vector<int> b) {
        if (a[0] == b[0]) {
            return a[1] < b[1];
        }
        return a[0] < b[0];
    }
    int helper(vector<int>& height1, vector<int>& height2) {
        if (height2.size() > height1.size()) {
            return helper(height2, height1);
        }
        int lastIndexValue = INT_MIN;
        int maxWidth = INT_MAX;
        int i = 0, j = 0;
        int n = height1.size();
        int m = height2.size();
        while (i < n && j < m){
            if (height1[i] == height2[j]) {
                if (lastIndexValue == INT_MIN) {
                    lastIndexValue = height1[i];
                } else{
                    maxWidth = min(maxWidth, abs(height1[i] - lastIndexValue));
                    lastIndexValue = height1[i];
                }
                i ++;
                j ++;
            } else if (height1[i] > height2[j]) {
                // lastIndexValue = INT_MIN;
                j ++;
            } else {
                // lastIndexValue = INT_MIN;
                i ++;
            }
        }
        return maxWidth == INT_MAX ? 0 : maxWidth;
    }
    int minAreaRect(vector<vector<int>>& points) {
        int ans = INT_MAX;
        sort(points.begin(), points.end(), compare);
        map<int, vector<int>> map;
        for (auto point : points) {
            map[point[0]].push_back(point[1]);
        }
        for (auto firstList = map.begin(); firstList != map.end(); firstList ++) {
            for (auto secondList = map.begin(); secondList != map.end(); secondList ++) {
                if (firstList == secondList) {
                    continue;
                }
                int width = abs(secondList -> first - firstList -> first);
                int height = helper(secondList -> second, firstList -> second);
                if (width != 0 && height != 0) {
                    ans = min(ans, height * width);
                }
            }
        }
        return ans == INT_MAX ? 0 : ans;
    }
};
52628