• 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

Practo Hiring Experience

Hackerearth : Counting Subarrays

SAP Interview Questions

Find min element in Sorted Rotated Array (Without Duplicates)

System Design: Designing a LLD for Hotel Booking

TicTacToe Game As Asked in Flipkart

Python List

Connect n ropes with minimum cost

Daughter’s Age VeryGood Puzzle

Find the smallest window in a string containing all characters of another string

C++ OOPs Part1

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

The Magic HackerEarth Nirvana solutions Hiring Challenge

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

Calculate price of parking from parking start end time prices

Handle duplicates in Binary Search Tree

Sort an array according to the order defined by another array

Find Percentage of Words matching in Two Strings

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

Password Predictor

BlueStone E-commerce Interview Experience

Naurki.com Security Breach

Apriori algorithm C Code Data Mining

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

Length of the longest substring without repeating characters

Puzzle : 100 doors in a row Visit and Toggle the door. What state the door will be after nth pass ?

Subset Sum Problem Dynamic programming

Diagonal Traversal of Binary Tree

Find loop in Singly linked list

Printing intermediate Integers between one element & next element of array

Copyright © 2025 · Genesis Framework · WordPress · Log in