• 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

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

Common Ancestor in a Binary Tree or Binary Search Tree

Connect n ropes with minimum cost

Diagonal Traversal of Binary Tree

Find next greater number with same set of digits

Walmart Labs Interview Experience

Adobe Interview Questions 8 month Exp

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

Sequence Finder Dynamic Programming

Inorder and Preorder traversals of a Binary Tree given. Output the Postorder traversal of it.

Find shortest distances between every pair of vertices ( Dynamic Programming Floyd Warshall Algorithm)

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

Stickler thief

BFS (Breath First Search)

Regular Expression Matching

Circular Linked List

Check Binary Tree is Binary Search Tree or not

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

SAP Off Campus Hiring_ March 2015 Sample Questions

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

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

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

Sort an array according to the order defined by another array

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 ?

Amazon Interview Experience – SDE Chennai

Find min element in Sorted Rotated Array (With Duplicates)

Right view of Binary tree

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

Given a float number convert it into the string WITHOUT using any inbuilt Function

K’th Largest Element in BST when modification to BST is not allowed

Copyright © 2026 · Genesis Framework · WordPress · Log in