← Questions
K closest points to a query location
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Given a list of 2D points and a query location, return the k points closest to it by Euclidean distance.
Compare sorting, a size-k max-heap and quickselect, and say which you would use when the points arrive as a stream.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding