• 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

Generic Object Oriented Stack with Template

Reliance Jio Software Developer Interview Experience

Practo Hiring Experience

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

Test Cases for Round Function

Circular Linked List

VMWare Openings

Maximum size of square sub matrix with all 1’s in a binary matrix

Add Sub Multiply very large number stored as string

25 horses 5 tracks Find 3 fastest puzzle

Naurki.com Security Breach

DFS (Depth First Search)

BlueStone E-commerce Interview Experience

Reverse a Linked List in groups of given size

Templates in C++

SAP Interview Questions

Implement LRU Cache

Maximum of all subarrays of size k

Fibonacci Hashing & Fastest Hashtable

Common Ancestor in a Binary Tree or Binary Search Tree

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

Subset Sum Problem Dynamic programming

Stock Buy Sell to Maximize Profit

building with N steps, we can take 1,2,3 steps calculate number of ways to reach at top of building

Leetcode: Merge Intervals

Python Array String

Find position of the only set bit

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

Daughter’s Age VeryGood Puzzle

C++ OOPs Part2

Copyright © 2026 · Genesis Framework · WordPress · Log in