Rectangle Overlap Python Solution with Tests

LeetCode 836, Easy. Topics: Math, Geometry. View on LeetCode. Generate this problem as a practice environment: tested reference solution, 18 parametrized pytest cases, and a playground notebook:

lcpy gen -n 836   # by problem number
lcpy gen -s rectangle_overlap   # by problem name

Problem

An axis-aligned rectangle is represented as a list [x1, y1, x2, y2], where (x1, y1) is the coordinate of its bottom-left corner, and (x2, y2) is the coordinate of its top-right corner. Its top and bottom edges are parallel to the X-axis, and its left and right edges are parallel to the Y-axis. Two rectangles overlap if the area of their intersection is positive. To be clear, two rectangles that only touch at the corner or edges do not overlap. Given two axis-aligned rectangles rec1 and rec2, return true if they overlap, otherwise return false.

Examples

Input: rec1 = [0,0,2,2], rec2 = [1,1,3,3]
Output: true

Input: rec1 = [0,0,1,1], rec2 = [1,0,2,1]
Output: false

Input: rec1 = [0,0,1,1], rec2 = [2,2,3,3]
Output: false

Constraints

rec1.length == 4
rec2.length == 4
-10^9 <= rec1[i], rec2[i] <= 10^9
rec1 and rec2 represent a valid rectangle with a non-zero area.

Solution

Reference implementation from solution.py on GitHub, full suite in test_solution.py:

class Solution:
    # Time: O(1)
    # Space: O(1)
    def is_rectangle_overlap(self, rec1: list[int], rec2: list[int]) -> bool:
        overlap_x = max(rec1[0], rec2[0]) < min(rec1[2], rec2[2])
        overlap_y = max(rec1[1], rec2[1]) < min(rec1[3], rec2[3])
        return overlap_x and overlap_y

Complexity

Time	Space
O(1)	O(1)

Welcome

Getting Started

Practice

CLI

Catalog

Contributing

Troubleshooting

Rectangle Overlap Python Solution with Tests

Problem

Examples

Constraints

Solution

Complexity

Tags

​Problem

​Examples

​Constraints

​Solution

​Complexity

​Tags

Problem

Examples

Constraints

Solution

Complexity

Tags