• 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

In Given LinkedList Divide LL in N Sub parts and delete first K nodes of each part

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

Find and print longest consecutive number sequence in a given sequence in O(n)

HackeEarth Flipkart’s Drone

Maximum size of square sub matrix with all 1’s in a binary matrix

Number of Islands BFS/DFS

Implement LRU Cache

Binary Tree in Java

Generic Object Oriented Stack with Template

Find two non repeating elements in an array of repeating elements

Introduction To Number Theory ( Part 1 )

Stickler thief

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

Trapping Rain Water

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

Closed Parentheses checker

Password Predictor

Find min element in Sorted Rotated Array (With Duplicates)

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

Find Percentage of Words matching in Two Strings

Apriori algorithm C Code Data Mining

Fibonacci Hashing & Fastest Hashtable

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

Printing Longest Common Subsequence

SAP Off Campus Hiring_ March 2015 Verbal Skills

Generate largest number arranging a no. of given non negative integer numbers

Common Ancestor in a Binary Tree or Binary Search Tree

Code Chef PRGIFT Solution

Leetcode: Edit Distance

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

Copyright © 2026 · Genesis Framework · WordPress · Log in