Minimum Area Rectangle

You are given an array points of distinct points on the plane, where points[i] = [x, y].

Return the minimum area of a rectangle whose sides are parallel to the x and y axes and whose four corners are all points in points. In other words, pick two different x values x1 < x2 and two different y values y1 < y2 such that all four points [x1, y1], [x1, y2], [x2, y1], [x2, y2] exist; the area is (x2 - x1) * (y2 - y1).

• Other points lying inside or on the edge of a rectangle do not matter.
• Rotated (non axis-aligned) rectangles do not count.
• If no such rectangle exists, return 0.