• 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 shortest distances between every pair of vertices ( Dynamic Programming Floyd Warshall Algorithm)

How Radix sort works

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

Common Ancestor in a Binary Tree or Binary Search Tree

Binary Tree Isomorphic to each other

Adobe Interview Questions 8 month Exp

Hackerearth : Counting Subarrays

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

Connect n ropes with minimum cost

Reversal of LinkedList

Spanning Tree

C++ OOPs Part1

Given array of 0’s and 1’s. All 0’s are coming first followed by 1’s. find the position of first 1

Doubly linked list

Python List

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

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 ?

Skiing on Mountains Matrix

Count Possible Decodings of a given Digit Sequence

System Design: Designing a LLD for Hotel Booking

Check Binary Tree is Binary Search Tree or not

Add Sub Multiply very large number stored as string

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

Length of the longest substring without repeating characters

Trapping Rain Water

SAP Off Campus Hiring_ March 2015 Sample Questions

Binary Tree in Java

Convert Decimal to Roman numbers / Romanizer HackerEarth Code

Edit Distance ( Dynamic Programming )

CodeChef Code SGARDEN

Copyright © 2026 · Genesis Framework · WordPress · Log in