<p>Given an array <code>rectangles</code> where <code>rectangles[i] = [x<sub>i</sub>, y<sub>i</sub>, a<sub>i</sub>, b<sub>i</sub>]</code> represents an axis-aligned rectangle. The bottom-left point of the rectangle is <code>(x<sub>i</sub>, y<sub>i</sub>)</code> and the top-right point of it is <code>(a<sub>i</sub>, b<sub>i</sub>)</code>.</p>

<p>Return <code>true</code> <em>if all the rectangles together form an exact cover of a rectangular region</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/03/27/perectrec1-plane.jpg" style="width: 300px; height: 294px;" />
<pre>
<strong>Input:</strong> rectangles = [[1,1,3,3],[3,1,4,2],[3,2,4,4],[1,3,2,4],[2,3,3,4]]
<strong>Output:</strong> true
<strong>Explanation:</strong> All 5 rectangles together form an exact cover of a rectangular region.
</pre>

<p><strong class="example">Example 2:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/03/27/perfectrec2-plane.jpg" style="width: 300px; height: 294px;" />
<pre>
<strong>Input:</strong> rectangles = [[1,1,2,3],[1,3,2,4],[3,1,4,2],[3,2,4,4]]
<strong>Output:</strong> false
<strong>Explanation:</strong> Because there is a gap between the two rectangular regions.
</pre>

<p><strong class="example">Example 3:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/03/27/perfecrrec4-plane.jpg" style="width: 300px; height: 294px;" />
<pre>
<strong>Input:</strong> rectangles = [[1,1,3,3],[3,1,4,2],[1,3,2,4],[2,2,4,4]]
<strong>Output:</strong> false
<strong>Explanation:</strong> Because two of the rectangles overlap with each other.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= rectangles.length &lt;= 2 * 10<sup>4</sup></code></li>
	<li><code>rectangles[i].length == 4</code></li>
	<li><code>-10<sup>5</sup> &lt;= x<sub>i</sub> &lt; a<sub>i</sub> &lt;= 10<sup>5</sup></code></li>
	<li><code>-10<sup>5</sup> &lt;= y<sub>i</sub> &lt; b<sub>i</sub> &lt;= 10<sup>5</sup></code></li>
</ul>

class Solution:
    def isRectangleCover(self, rectangles):
        # Helper function to get the area of a rectangle
        def getArea(rect):
            x1, y1, x2, y2 = rect
            return (x2 - x1) * (y2 - y1)
        
        # Initialize variables to track the bounding box and corner points
        area = 0
        corners = set()
        
        # Iterate through each rectangle
        for rect in rectangles:
            x1, y1, x2, y2 = rect
            
            # Add the area of the current rectangle to the total area
            area += getArea(rect)
            
            # Define the corners of the current rectangle
            corners_rect = [(x1, y1), (x1, y2), (x2, y1), (x2, y2)]
            
            # Update the corner points set
            for corner in corners_rect:
                if corner in corners:
                    corners.remove(corner)
                else:
                    corners.add(corner)
            
        # If the number of remaining corners is not 4, return False
        if len(corners) != 4:
            return False
        
        # Calculate the bounding box of the union of all rectangles
        x1, y1 = min(corners, key=lambda x: x[0])[0], min(corners, key=lambda x: x[1])[1]
        x2, y2 = max(corners, key=lambda x: x[0])[0], max(corners, key=lambda x: x[1])[1]
        
        # Check if the area of the bounding box is equal to the total area of the rectangles
        return area == getArea([x1, y1, x2, y2])

# Example usage:
solution = Solution()
rectangles = [[1,1,3,3],[3,1,4,2],[3,2,4,4],[1,3,2,4],[2,3,3,4]]
print(solution.isRectangleCover(rectangles))  # Output: True
22400