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:

Note: You can return the result in any order. The answer is guaranteed to be unique, except for the order in which points appear.

Constraints:

• $1 \leq$ k $\leq$ points.length $\leq 10^3$

• $-10^4 \leq x_i, y_i \leq 10^4$

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.