Dataford
Interview QuestionsInterview GuidesExperiencesMock InterviewsPricing
Get started

Nearest Obstacles via Indexing

HardCoding00:00
Practice interviewer
In session
5 left
00:00

Your question is Nearest Obstacles via Indexing. Take a moment with it on the right.

Talk me through your thinking if you like. When you're confident, submit your answer and I'll grade it like a real screen (7/10 or better passes).

You need to log in / sign up to chat or submit.

Problem

Implement a spatial indexing algorithm, such as a 2D grid or KD-tree, to find the nearest obstacles to a Motional autonomous vehicle.