> For the complete documentation index, see [llms.txt](https://grind75-notes.gitbook.io/notes/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://grind75-notes.gitbook.io/notes/week-3/k-closest-points-to-origin.md).

# K Closest Points to Origin

{% embed url="<https://leetcode.com/problems/k-closest-points-to-origin>" %}

### Problem

> Given an array of `points` where `points[i] = [xi, yi]` 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., `√(x1 - x2)2 + (y1 - y2)2`).
>
> You may return the answer in **any order**. The answer is **guaranteed** to be **unique** (except for the order that it is in).
>
> &#x20;
>
> **Example 1:**
>
> ![](https://assets.leetcode.com/uploads/2021/03/03/closestplane1.jpg)
>
> <pre data-overflow="wrap"><code>Input: points = [[1,3],[-2,2]], k = 1
> <strong>Output: [[-2,2]]
> </strong><strong>Explanation:
> </strong>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) &#x3C; sqrt(10), (-2, 2) is closer to the origin.
> We only want the closest k = 1 points from the origin, so the answer is just [[-2,2]].
> </code></pre>
>
> **Example 2:**
>
> <pre><code>Input: points = [[3,3],[5,-1],[-2,4]], k = 2
> <strong>Output: [[3,3],[-2,4]]
> </strong><strong>Explanation: The answer [[-2,4],[3,3]] would also be accepted.
> </strong></code></pre>

### Pseudocode

```
- calculate area, sort in ascending order, splice from 0 to kth
```

### Solution

```javascript
// https://leetcode.com/problems/k-closest-points-to-origin/
var kClosest = function (points, k) {
  function distance(point) {
    return point[0] * point[0] + point[1] * point[1];
  }

  return points
    .sort((a, b) => {
      return distance(a) - distance(b);
    })
    .slice(0, k);
};

```

### Time and Space Complexity

#### Time

* What did the code do
* Total -

#### Space

* What did the code do
* Total -