Spoke to Bloomberg engineers at a career fair. I was asked to reverse a linked list on paper and was scheduled for an interview the next day on campus. I ended up completing three interviews in four days.

A week later, I received an email from the recruiter asking for any deadlines, which I didn't have at the time. I didn't hear anything for two weeks. Then, I sent an email to the recruiter informing her that I had received offers and had to reply within the next three weeks.

She emailed me back the next morning saying she'd get to me soon. I received a call that afternoon with the offer.

At career fair:

Reverse a linked list with O(1) space.

First interview:

Given a map of flights and miles accumulated, a starting location, and the maximum number of flights, find the path to travel the maximum possible distance without exceeding the maximum number of flights and ending at the starting location.

Print a matrix diagonal by diagonal (bottom-left diagonal first, then work up to the top-right diagonal).

Second interview:

Print the path between two nodes in a BST.

Implement a method that, when called, returns whether or not that method has been called more than 10 times in the previous 10 seconds.

Third interview:

Given two sorted arrays, return the median if the arrays were combined. (Can be done in log(n) time).