Nearest Points to Origin | Dataford Interview Questions

Given an array of spatial coordinates, write an efficient algorithm to find the nearest points to a specific origin.

Return exactly k points, ordered by increasing squared Euclidean distance from the origin. Break equal-distance ties by original input order. Implement nearest_points(points, origin, k), where points and origin contain integer 2D coordinates and the result contains coordinate pairs from points.

Constraints

1 <= k <= len(points) <= 5000
Each coordinate is an integer in the range -10^9 to 10^9
Each point contains exactly two coordinates
origin contains exactly two coordinates
Return points in increasing squared-distance order, breaking ties by input order

Function Signature

def nearest_points(points, origin, k):

Your question is Nearest Points to Origin. 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

Given an array of spatial coordinates, write an efficient algorithm to find the nearest points to a specific origin.

Constraints

1 <= k <= len(points) <= 5000
Each coordinate is an integer in the range -10^9 to 10^9
Each point contains exactly two coordinates
origin contains exactly two coordinates
Return points in increasing squared-distance order, breaking ties by input order

Function Signature

def nearest_points(points, origin, k):

Your question is Nearest Points to Origin. 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.