Problem

You are given an array of points in a 2D plane, where each point is represented as [x, y], and an integer k.

Your task is to return any k points whose Euclidean distance to the origin (0, 0) is smallest among all points in the array.

The distance of a point [x, y] from the origin is determined by $x^2 + y^2$ (you do not need to compute the square root).

If multiple points are tied for distance, any valid set of k points is acceptable.

Input Format

• An integer array points, where points[i] = [x_i, y_i]
• An integer k

Output Format

• Return an array containing any k points with the smallest distance to the origin

Constraints

• 1 <= k <= points.length
• points.length is at least 1
• Coordinates may be positive, negative, or zero

Hints

• Comparing squared distances is enough.
• Think about how to efficiently keep track of the current closest k points while scanning the array.