Please solve the programming task below using a self-contained code snippet in a markdown code block.

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).
 
Please complete the following python code precisely:
```python
class Solution:
    def kClosest(self, points: List[List[int]], k: int) -> List[List[int]]:
```