A delivery drone lives at the point (0, 0). It wants the drop-off spot closest to home.
Part 1: Point(x, y)
Each point stores x, y, and distance: how far it is from (0, 0), worked out as (x ** 2 + y ** 2) ** 0.5, rounded to 2 decimal places.
Part 2: closest_point(coords)
coords is a list of (x, y) pairs. It always has at least one pair. Make a Point for each pair, then return [x, y] of the point with the smallest distance. If two points tie, return the one that comes first.