I was contacted by a recruiting company that was hiring for Bloomberg. The application process was fairly straightforward, though it did require filling out many questions. The recruiting company arranged the times and handled the logistics.

They set up a 1.5-hour technical interview through HackerRank. The question involved an application that required the use of specific data structures. The interviewer was very polite, and we brainstormed through the exercise. We discussed hash maps, vectors, and lists during the course of the implementation, using them to solve the problem. My language of choice was C++, so I used the STL versions of the data structures.

I didn't receive an offer at the end, but I enjoyed the experience.

If you had n racers and m checkpoints, how would you list out the racers in the order in which they are in the race, given that each checkpoint gets a notification when a specific racer crosses it?