I applied for a non-computer science entry-level position. They responded very quickly, within a couple of days.

The phone interview was brief. They inquired about my university work and any programming experience. Subsequently, they asked about the stack versus heap, garbage collection in C++ versus Java, and other fundamental concepts.

I was then invited for a face-to-face interview. During this interview, I was asked why I wanted to work for Bloomberg and what made me a suitable candidate.

They presented a problem: finding the first missing element in a sorted set of N-1 numbers. Their focus was on sublinear complexity algorithms, not the linear complexity approach of calculating the sum from 1 to N minus the sum of all elements in the set.

They also asked about finding the maximum loss of a trading day given a set of numbers and how I would implement a solution.

They replied approximately 24 hours after the face-to-face interview. Overall, it was a pleasant experience. The office does indeed offer complimentary snacks and coffee, and features very impressive aquariums.

1. Find the missing number in a sorted set of N-1 integers (numbers between 1 and N).

2. Keep track of the maximum loss of the day given 1 index and the prices.