• 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

Get Minimum element in O(1) from input numbers or Stack

Python List

Regular Expression Matching

Reliance Jio Software Developer Interview Experience

Binary Tree in Java

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

Inorder and Preorder traversals of a Binary Tree given. Output the Postorder traversal of it.

Stock Buy Sell to Maximize Profit

Find the number ABCD such that when multipled by 4 gives DCBA.

CodeChef Code SGARDEN

Password Predictor

C++ OOPs Part2

Mirror of Tree

Serialise Deserialise N-ary Tree

How strtok() Works

Convert number to words java

Knight Tour Problem (Graph – Breadth First Search)

Generate next palindrome number

Introduction To Number Theory ( Part 1 )

Advanced SQL Injection

Apriori algorithm C Code Data Mining

Find the kth number with prime factors 3, 5 and 7

In Given LinkedList Divide LL in N Sub parts and delete first K nodes of each part

Flipkart Set 1 On Campus with Answers

Diagonal Traversal of Binary Tree

Python String and numbers

Cisco Hiring Event 21st – 22nd Feb 2015

Leetcode: Edit Distance

25 horses 5 tracks Find 3 fastest puzzle

Find the element that appears once others appears thrice

Copyright © 2026 · Genesis Framework · WordPress · Log in