Skip to content
This repository has been archived by the owner on Apr 24, 2020. It is now read-only.

smozely/QuadTree

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

19 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

QuadTree

Quadtree Interview Test

Overview

This is an interview screening test that we have been running people through for a few years now. It is intended to be run as a (psuedo) pair programming exercise, and the main goal from the test is not for the candidate to finish but more to get some time understanding how they work. Given the timeframe we allow candiates, unless the have alreayd had experience with this type of problem before they are unlikly to finish.

Problem Statement

Given a set of data points in 2D Space, and a Rectangle, reutrn the list of Data Points that lie within the rectangle.

This is optimized by using a QuadTree data structure to make the

The Data Set

All points in the data set lie in 2D space between (-1, -1) and (1, 1). This knowledge can be used as a starting point.