msb-public
/
tech-interview-handbook
mirror of https://github.com/yangshun/tech-interview-handbook
2
1
Code Issues Projects Releases Wiki Activity
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'afc6e6270c'
${ noResults }
tech-interview-handbook/apps/website/contents/algorithms/geometry.md

2.9 KiB
Raw Blame History

id title description keywords sidebar_label toc_max_heading_level
geometry Geometry cheatsheet for coding interviews Geometry study guide for coding interviews, including practice questions, techniques, time complexity, and recommended resources
geometry coding interview study guide
geometry tips for coding interviews
geometry practice questions
geometry useful techniques
geometry time complexity
geometry recommended study resources
Geometry 2
<head> </head>

Introduction

Geometry is a branch of mathematics that is concerned with properties of space that are related with distance, shape, size, and relative position of figures. Advanced geometry (e.g. 3D geometry) is not taught in most Computer Science courses, so you can expect that you will only be asked on 2D geometry.

In algorithm interviews, geometry is usually not be the focus of the problem (you're not being evaluated on mathematics after all). You typically have to use other algorithms and/or data structures in the problem.

Corner cases

  • Zero values. This always gets people.

Techniques

Distance between two points

When comparing the distance between two points, using dx2 + dy2 is sufficient. It is unnecessary to square root the value. Examples: K Closest Points to Origin

Overlapping circles

To find out if two circles overlap, check that the distance between the two centers of the circles is less than the sum of their radii.

Overlapping rectangles

Two rectangles overlap if the following is true:

overlap = rect_a.left < rect_b.right and \
  rect_a.right > rect_b.left and \
  rect_a.top > rect_b.bottom and \
  rect_a.bottom < rect_b.top

Here's a nice visualization. Examples: Rectangle Overlap

Sample questions

  • You have a plane with lots of rectangles on it, find out how many of them intersect.
  • Which data structure would you use to query the k-nearest points of a set on a 2D plane?
  • Given many points, find k points that are closest to the origin.
  • How would you triangulate a polygon?

Essential questions

These are essential questions to practice if you're studying for this topic.

Recommended practice questions

These are recommended questions to practice after you have studied for the topic and have practiced the essential questions.

Recommended courses

import AlgorithmCourses from '../_courses/AlgorithmCourses.md'