Python Solution || Faster Than 99.33% Of Python3 Submissions
\nclass Solution:\n    def isRectangleOverlap(self, rec1: List[int], rec2: List[int]) -> bool:\n        IntersectionX = max(0, min(rec1[2], rec2[2]) - max(rec1[
```\nclass Solution:\n    def isRectangleOverlap(self, rec1: List[int], rec2: List[int]) -> bool:\n        IntersectionX = max(0, min(rec1[2], rec2[2]) - max(rec1[0], rec2[0]))\n        IntersectionY =  max(0, min(rec1[3], rec2[3]) - max(rec1[1], rec2[1]))\n        return IntersectionX != 0 and IntersectionY != 0\n```
[]