• 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

Memory Efficient LinkedList

Find if a binary tree is height balanced ?

Diagonal Traversal of Binary Tree

Amazon Interview Experience – SDE Chennai

C Program for TAIL command of UNIX

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

Check Binary Tree is Binary Search Tree or not

Generic Object Oriented Stack with Template

robot standing at first cell of an M*N matrix. It can move only in two directions, right and down. In how many ways, it can reach to the last cell i.e. (M, N) Code it

Connect n ropes with minimum cost

Stickler thief

Circular Linked List

Binary Tree in Java

Find loop in Singly linked list

SAP Off Campus Hiring_ March 2015 Verbal Skills

How strtok() Works

SAP Hiring Off-Campus General Aptitude

Find the kth number with prime factors 3, 5 and 7

Maximum sum contiguous subarray of an Array

Subset Sum Problem Dynamic programming

VMWare SDEII Interview

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

Adobe Interview Questions 8 month Exp

Find min element in Sorted Rotated Array (Without Duplicates)

LeetCode : Word Search

Sort Stack in place

Given a sorted array and a number x, find the pair in array whose sum is closest to x

Sort an array according to the order defined by another array

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

Get Minimum element in O(1) from input numbers or Stack

Copyright © 2026 · Genesis Framework · WordPress · Log in