Algorithm · C3.ai · Medium
You are given a collection of points lying in a two-dimensional plane, together with an integer k. Find the k points whose Euclidean distance to the origin $$(0, 0)$$ is smallest, and return them. The returned points may appear in any order. Examples Example 1 Example 2