Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 973. K Closest Points to Origin
Given N points on the plane and an integer k, return the k points with the smallest Euclidean distance to the origin (order doesn't matter). The core challenge is efficiently selecting the k smallest distances (e.g., via a max-heap or quickselect/partial sort) for up to N = 10^4 points.
Asked at:
Meta
Amazon
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Late October, 2025
Meta
Senior
Mid October, 2025
Meta
Senior
Late September, 2025
Meta
Staff
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.