I submitted my application online on both my university's career website and Bloomberg's career site.

One week later, I received a notification to complete an online assessment test. After finishing the test, I was asked to schedule a phone interview.

Two weeks later, in the phone interview, I was first asked about why Bloomberg and why I was discontinuing my current interests to choose the financial industry.

Then, I was asked some technical questions about C++, linked lists, hash tables, and BSTs.

After that, there were three brain teaser questions.

Overall, the interview was not difficult, but I think I "screwed up" because I did badly on the behavioral questions.

How do you reverse a linked list?

There are 10 boxes of apples. Each apple in the boxes weighs 1 pound, except that one of the boxes contains bad apples, which weigh 0.9 pound each. You are given a digital weight (not a scale), and you can take apples out of the boxes. What is the minimum number of weighs to find out which box has bad apples?

I gave one solution of 3 times using divide and conquer, but the interviewer said 1 step is possible. So I couldn't come up with the solution.

How to design a good hash function if the key is a person's name?