Blogs Hub

Rectangle Overlap - Math - Easy - LeetCode - MiniTV

Rectangle Overlap - Math - Easy - LeetCode - मिनी टीवी

A rectangle is represented as a list [x1, y1, x2, y2], where (x1, y1) are the coordinates of its bottom-left corner, and (x2, y2) are the coordinates of its top-right corner.

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, return whether they overlap.

Example 1:

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

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

Both rectangles rec1 and rec2 are lists of 4 integers.
All coordinates in rectangles will be between -10^9 and 10^9.

public class Solution {
    public bool IsRectangleOverlap(int[] rec1, int[] rec2) {
        int width = distance(rec1[0],rec2[0],rec1[2],rec2[2]);
        int height = distance(rec1[1],rec2[1],rec1[3],rec2[3]);
        if(width<=0 || height<=0){
            return false;
        return true;
    int distance(int bxy1, int bxy2, int txy1, int txy2) {
        if(bxy1 > txy2 || bxy2 > txy1) {
            return 0;
        return Math.Min(txy1, txy2) - Math.Max(bxy1, bxy2);

Time Complexity: O(1)

Space Complexity: O(1)