• 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

Trapping Rain Water

Leetcode: Edit Distance

Advanced SQL Injection

Possible sizes of bus to carry n groups of friends

C++ OOPs Part1

C Program for TAIL command of UNIX

Maximum occurred Smallest integer in n ranges

Calculate price of parking from parking start end time prices

Find Pythagorean Triplets in an array in O(N)

Diagonal Traversal of Binary Tree

Find the smallest window in a string containing all characters of another string

Number of Islands BFS/DFS

Binary Tree in Java

CodeChef Code SGARDEN

Find and print longest consecutive number sequence in a given sequence in O(n)

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

LeetCode: Binary Tree Maximum Path Sum

Amazon Interview On-Campus For Internship – 1

Walmart Labs Interview Experience

Find Nearest Minimum number in left side in O(n)

Best Java Book | Top Java Programming Book for Beginners

BFS (Breath First Search)

Convert Decimal to Roman numbers / Romanizer HackerEarth Code

Python List

Apriori algorithm C Code Data Mining

Length of the longest substring without repeating characters

C++ OOPs Part2

K’th Largest Element in BST when modification to BST is not allowed

Generic Object Oriented Stack with Template

Print all nodes that are at distance k from a leaf node

Copyright © 2025 · Genesis Framework · WordPress · Log in