Statement

You are given an array of points where each element points[i] $= [x_i, y_i]$ represents a point on the X-Y plane, along with an integer k. Your task is to find and return the k points that are closest to the origin $[0, 0]$ .

The distance between two points on the X-Y plane is measured using Euclidean distance, which is calculated as:

K Closest Points to Origin

1.

(Select all that apply.) What is the output if the following data is given as an input?

points $= [[1, 3], [-2, 4], [2, -1], [-2, 2], [5, -3], [3, -2]]$

k $= 3$

A.

$[[1, 3], [-2, 2], [5, -3]]$

B.

$[[1, 3], [2, -1], [-2, 2]]$

C.

$[[2, -1], [-2, 4], [1, 3]]$

D.

$[[1, 3], [-2, 2], [3, -2]]$

1 / 3

JavaScript

usercode > Solution.js

import { MaxHeap, MinHeap } from "./Heap.js"

/* The following definition is for MinHeap.

  You can use the same methods for MaxHeap.
  class MinHeap {

    size();          // return number of elements
    peek();          // return top element without removing
    push(val);       // insert element
    pop();           // remove and return top element
  }
*/

function kClosest(points, k){
    
    // Replace this placeholder return statement with your code
    return -1;
}

export { 
    kClosest
}

K Closest Points to Origin

Top K Elements

Heaps

Conclusion

K Closest Points to Origin

Statement

Examples

Understand the problem

Figure it out!

Try it yourself