• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

Find if two rectangles overlap

August 27, 2014 by Dhaval Dave

Given two rectangles, find if the given two rectangles overlap or not.

Note that a rectangle can be represented by two coordinates, top left and bottom right. So mainly we are given following four coordinates.

l1: Top Left coordinate of first rectangle.
r1: Bottom Right coordinate of first rectangle.
l2: Top Left coordinate of second rectangle.
r2: Bottom Right coordinate of second rectangle

Two rectangles do not overlap if one of the following conditions is true.

1) if  l1.x > r2.x  OR l2.x > r1.x  // If one rectangle is on left side of other Case (3)
2) if  l1.y < r2.y  OR  l2.y < r1.y // If one rectangle is above other Case(4) not presented here.

Case 1) and 2) are Overlapping.
hence here it should return false.

Code : Following code returns true if two rectangles overlap.

struct Coord
{
    int x, y;
};
bool RectOverlap(Coord l1, Coord r1, Coord l2, Coord r2)
{
    if (l1.x > r2.x || l2.x > r1.x) return false;
    if (l1.y < r2.y || l2.y < r1.y) return false;

    return true; //else in all condition
}

Similar Articles

Filed Under: Amazon Interview Question, Interview Questions, Microsoft Interview Questions, problem Tagged With: Mathematical

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

Wrong Directions given find minimum moves so that he can reach to the destination

Templates in C++

Max Sum in circularly situated Values

Level order traversal in Spiral form

Given a float number convert it into the string WITHOUT using any inbuilt Function

Microsoft BING Interview Experience

Binary Tree Isomorphic to each other

Doubly linked list

Word Break Problem

System Design: Designing a LLD for Hotel Booking

Sort an array according to the order defined by another array

Code Chef PRGIFT Solution

Binary Tree in Java

Subset Sum Problem Dynamic programming

Leetcode: Merge Intervals

N Petrol bunks or City arranged in circle. You have Fuel and distance between petrol bunks. Is it possible to find starting point so that we can travel all Petrol Bunks

There are N nuts and N bolts, u have to find all the pairs of nuts and bolts in minimum no. of iteration

Count number of ways to reach a given score in a game

Linked List V/S Binary Search Tree

Number of Islands BFS/DFS

Walmart Labs Interview Experience

BFS (Breath First Search)

Flipkart Set 1 On Campus with Answers

Advanced SQL Injection

Calculate price of parking from parking start end time prices

Python Array String

Regular Expression Matching

Generate next palindrome number

Maximum sum contiguous subarray of an Array

Maximum size of square sub matrix with all 1’s in a binary matrix

Copyright © 2025 · Genesis Framework · WordPress · Log in