• 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

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

Maximum occurred Smallest integer in n ranges

Binary Tree Isomorphic to each other

Rectangular chocolate bar Create at least one piece which consists of exactly nTiles tiles

C++ OOPs Part1

CodeChef’ RRCOPY

Leetcode: Edit Distance

C Program for TAIL command of UNIX

Max Sum in circularly situated Values

Interfaces in C++ (Abstract Classes in C++)

Microsoft BING Interview Experience

Printing intermediate Integers between one element & next element of array

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

‘N’ Story Building, with 1,2,3 steps how many ways can a person reach top of building.

SAP Off Campus Hiring_ March 2015 Analytical Aptitude

Length of the longest substring without repeating characters

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

Doubly linked list

Edit Distance ( Dynamic Programming )

The Magic HackerEarth Nirvana solutions Hiring Challenge

Amazon Interview On-Campus For Internship – 1

Word Break Problem

robot standing at first cell of an M*N matrix. It can move only in two directions, right and down. In how many ways, it can reach to the last cell i.e. (M, N) Code it

Password Predictor

Printing each word reverse in string

Check a String is SUBSEQUENCE of another String Find Minimum length for that ( DNA Matching )

Find min element in Sorted Rotated Array (Without Duplicates)

Leetcode: Merge Intervals

Find Pythagorean Triplets in an array in O(N)

Fibonacci Hashing & Fastest Hashtable

Copyright © 2026 · Genesis Framework · WordPress · Log in