• 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

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

Max Sum in circularly situated Values

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

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

Maximum sum contiguous subarray of an Array

Longest Increasing Subsequence

Reverse a Linked List in groups of given size

Stock Buy Sell to Maximize Profit

Facebook Interview Question : Interleave List

Printing Longest Common Subsequence

CodeChef’ RRCOPY

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

C Program for TAIL command of UNIX

Binary Tree Isomorphic to each other

Stickler thief

How Radix sort works

C++ OOPs Part1

Check if an array has duplicate numbers in O(n) time and O(1) space

Generic Object Oriented Stack with Template

FizzBuzz Solution C C++

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

Given array of 0’s and 1’s. All 0’s are coming first followed by 1’s. find the position of first 1

Diagonal Traversal of Binary Tree

Find min element in Sorted Rotated Array (Without Duplicates)

Given Set of words or A String find whether chain is possible from these words or not

Fibonacci Hashing & Fastest Hashtable

Doubly linked list

Trie Dictionary

Find loop in Singly linked list

Edit Distance ( Dynamic Programming )

Copyright © 2026 · Genesis Framework · WordPress · Log in