The goal was to find the k closest points to the origin (0, 0) on an X-Y plane, using Euclidean distance.The initial solution used a map<double, vector<int>> to store the distance along with the corresponding point.After encountering a failing test case, it was realized that distance isn't always unique, so a map<double, vector<vector<int>>> was used instead.The updated solution worked perfectly and the problem was solved in 21 minutes.