• 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

Stickler thief

flattens 2 D linked list to a single sorted link list

Calculate price of parking from parking start end time prices

Top 10 Interviews Techniqes for Campus Interview in IIT NIT BITS for MTech

Cisco Hiring Event 21st – 22nd Feb 2015

Find min element in Sorted Rotated Array (With Duplicates)

Longest Increasing Subsequence

Maximum difference between two elements s.t larger element appears after the smaller number

1014 Practice Question of New GRE – Princeton

Flipkart SDET Interview Experience

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

SAP Off Campus Hiring_ March 2015 Verbal Skills

Amazon Interview On-Campus For Internship – 1

Implement LRU Cache

Coin Collection Dynamic Programming

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

Reliance Jio Software Developer Interview Experience

Singly linked list

Get K Max and Delete K Max in stream of incoming integers

VMWare SDEII Interview

LeetCode : Word Search

SAP Off Campus Hiring_ March 2015 Sample Questions

Print Power Set of a Set

C++ OOPs Part2

Knight Tour Problem (Graph – Breadth First Search)

Find the element that appears once others appears thrice

Flipkart Set 1 On Campus with Answers

write a c program that given a set a of n numbers and another number x determines whether or not there exist two elements in s whose sum is exactly x

Max Sum in circularly situated Values

Find shortest distances between every pair of vertices ( Dynamic Programming Floyd Warshall Algorithm)

Copyright © 2026 · Genesis Framework · WordPress · Log in