• 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

Templates in C++

Mirror of Tree

Edit Distance ( Dynamic Programming )

Generic Object Oriented Stack with Template

Coin Collection Dynamic Programming

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

Printing each word reverse in string

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

Introduction To Number Theory ( Part 1 )

Level order traversal in Spiral form

C++ OOPs Part2

Maximum occurred Smallest integer in n ranges

Calculate price of parking from parking start end time prices

Password Predictor

Longest Increasing Subsequence

System Design: Designing a LLD for Hotel Booking

Right view of Binary tree

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

Common Ancestor in a Binary Tree or Binary Search Tree

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

Sequence Finder Dynamic Programming

Closed Parentheses checker

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

Binary Tree in Java

Cisco Hiring Event 21st – 22nd Feb 2015

Serialise Deserialise N-ary Tree

Generate next palindrome number

Find the number ABCD such that when multipled by 4 gives DCBA.

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

Maximum sum contiguous subarray of an Array

Copyright © 2026 · Genesis Framework · WordPress · Log in