<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) {
        /*
        1-> 1 3
        3-> 1 3
        4-> 1 3
        distance between i,i+1 * all j,j+1
        */
        vector<vector<int>> arrayY;
        vector<int> X;
        sort(points.begin(), points.end());
        for (int i = 0; i < points.size(); i++) {
            X.push_back(points[i][0]);
            if (i != 0 && X[X.size() - 1] == X[X.size() - 2])
                X.pop_back();
        }
        vector<int> temp;
        for (int i = 0; i < points.size(); i++) {
            temp.push_back(points[i][1]);
            if ((i < points.size() - 1 && points[i][0] != points[i + 1][0]) ||
                i == points.size() - 1) {
                arrayY.push_back(temp);
                temp = {};
            }
        }

        int mini = INT_MAX;

        for (int i = 0; i < X.size() - 1; i++) {
            vector<int> a = arrayY[i];
            int j = i + 1;
            while (j < X.size()) {
                vector<int> b = arrayY[j];
                int prod1 = X[j] - X[i];
                vector<int> intersection;
                set_intersection(a.begin(), a.end(), // First vector range
                                 b.begin(), b.end(), // Second vector range
                                 back_inserter(intersection) // Output iterator
                );
                cout << intersection.size();
                int prod2 = INT_MAX;
                if (intersection.size() < 2){
                    j++;
                    continue;
                }
                for (int k = 0; k < intersection.size() - 1; k++) {
                    prod2 = min(prod2, intersection[k+1] - intersection[k]);
                }
                if (prod2 != INT_MAX)
                    mini = min(prod1 * prod2, mini);
                j++;
            }
        }
        if(mini==INT_MAX) return 0;
        return mini;
    }
};
173771