K closest points to origin
Given a list of 2D points and an integer k, return the k points closest to the origin (0,0) by Euclidean distance. Return them sorted by ascending distance; ties broken by smaller x then smaller y. Constraints: 1 <= k <= len(points) <= 10^4, -10^4 <= coordinates <= 10^4.
Implement
k_closest_points(points: list[list[int]], k: int) → list[list[int]]Examples
in
[[[1,3],[-2,2]],1]out[[-2,2]]What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 25 min
solution.py
InputExpectedGot
[[[1,3],[-2,2]],1][[-2,2]]not run yetsample