• 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

CodeChef’ RRCOPY

Maximum sum contiguous subarray of an Array

Level order traversal in Spiral form

N teams are participating. each team plays twice with all other teams. Some of them will go to the semi final. Find Minimum and Maximum number of matches that a team has to win to qualify for finals ?

Difference between a LinkedList and a Binary Search Tree BST

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

Walmart Labs Interview Experience

Trapping Rain Water

Find two non repeating elements in an array of repeating elements

Hackerearth : Counting Subarrays

Print all nodes that are at distance k from a leaf node

FizzBuzz Solution C C++

C++ OOPs Part2

VMWare SDEII Interview

C Program for TAIL command of UNIX

simple sql injection

strtok()

Binary Tree in Java

Naurki.com Security Breach

Linked List V/S Binary Search Tree

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

Find an index i such that Arr [i] = i in array of n distinct integers sorted in ascending order.

Client Server C program

Coin Collection Dynamic Programming

Mirror of Tree

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

Longest Increasing Subsequence

Amazon Interview On-Campus For Internship – 1

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

Edit Distance ( Dynamic Programming )

Copyright © 2026 · Genesis Framework · WordPress · Log in