Medium
K Closest Points to Origin
Medium
0 submissions
25 coins
+100 XP
Array
Divide and Conquer
Heap (Priority Queue)
Math
Sorting
Problem Description
# K Closest Points to Origin
Given an array of `points` where `points[i] = [x_i, y_i]` represents a point on the X-Y plane and an integer `k`, return the `k` closest points to the origin `(0, 0)`.
The distance between two points on the X-Y plane is the Euclidean distance (i.e., √(x₁ - x₂)² + (y₁ - y₂)²).
You may return the answer in **any order**. The answer is guaranteed to be **unique** (except for the order that it is returned).
## Example 1
```
Input: points = [[1,3],[-2,2]], k = 1
Output: [[-2,2]]
Explanation:
The distance between (1, 3) and the origin is sqrt(10).
The distance between (-2, 2) and the origin is sqrt(8).
Since sqrt(8) < sqrt(10), (-2, 2) is closer to the origin.
```
## Example 2
```
Input: points = [[3,3],[5,-1],[-2,4]], k = 2
Output: [[3,3],[-2,4]]
```
## Constraints
- `1 <= k <= points.length <= 10⁴`
- `-10⁴ <= x_i, y_i <= 10⁴`
Constraints
- 1 <= k <= points.length <= 10⁴\n- -10⁴ <= x_i, y_i <= 10⁴
Need help?
Connect with expert programmers for real-time collaborative coding, video meetings, and whiteboard sessions via CodeConnect.
Video Call
Whiteboard
Live Coding
Screen Share