Closest K Driver Partners | Dataford Interview Questions

Given an array of coordinates, find the closest K driver partners to a user's request location for Didi Labs.

Implement find_closest_drivers(drivers, request_location, k). Each coordinate is [x, y]; return the selected coordinate arrays ordered from nearest to farthest. Use squared Euclidean distance, and break equal-distance ties by the drivers' original array order.

Input and Output

drivers is a non-empty list of coordinates, request_location is one coordinate, and k is between 1 and the number of drivers. Return exactly k coordinates.

Constraints

1 <= len(drivers) <= 5000
1 <= k <= len(drivers)
Each coordinate has exactly two integer values
-10^9 <= coordinate value <= 10^9
Return the original coordinate arrays, ordered by squared distance and then original index

Function Signature

def find_closest_drivers(drivers, request_location, k):

Your question is Closest K Driver Partners. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem