• 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

Memory Efficient LinkedList

Maximum of all subarrays of size k

TicTacToe Game As Asked in Flipkart

Find position of the only set bit

Sequence Finder Dynamic Programming

Number of Islands BFS/DFS

Add Sub Multiply very large number stored as string

CodeChef Code SGARDEN

SAP Off Campus Hiring_ March 2015 Analytical Aptitude

Possible sizes of bus to carry n groups of friends

Templates in C++

Singly linked list

Minimum insertions to form a palindrome

Right view of Binary tree

Connect n ropes with minimum cost

Find the element that appears once others appears thrice

Amazon Interview On-Campus For Internship – 1

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

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

Count Possible Decodings of a given Digit Sequence

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

VMWare Openings

N Petrol bunks or City arranged in circle. You have Fuel and distance between petrol bunks. Is it possible to find starting point so that we can travel all Petrol Bunks

Password Predictor

Skiing on Mountains Matrix

Find two non repeating elements in an array of repeating elements

BFS (Breath First Search)

Level order traversal in Spiral form

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

Copyright © 2025 · Genesis Framework · WordPress · Log in