Distance-Based Sorting | Dataford Interview Questions

Given a list of x, y value, sort the list in ascending order based on their distance to the origin.

Implement sort_points(points), where points is a list of two-element coordinate lists [x, y]. Return a new list ordered by increasing Euclidean distance from (0, 0). Points with equal distances must retain their original relative order.

Constraints

0 <= points.length <= 10^4
Each point contains exactly two integers, x and y
-10^9 <= x, y <= 10^9
Points with equal distances must retain their original relative order
Return a new list and do not modify points

Function Signature

def sort_points(points):

Your question is Distance-Based Sorting. 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 a list of x, y value, sort the list in ascending order based on their distance to the origin.

Constraints

0 <= points.length <= 10^4
Each point contains exactly two integers, x and y
-10^9 <= x, y <= 10^9
Points with equal distances must retain their original relative order
Return a new list and do not modify points

Function Signature

def sort_points(points):

Your question is Distance-Based Sorting. 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.