Software Developer applicants have rated the interview process at Bloomberg with 3 out of 5 (where 5 is the highest level of difficulty) and assessed their interview experience as 100% positive. To compare, the company-average is 52.9% positive. This is according to Glassdoor user ratings.
Candidates applying for Software Developer roles take an average of 5 days to get hired, when considering 1 user submitted interviews for this role. To compare, the hiring process at Bloomberg overall takes an average of 28 days.
Common stages of the interview process at Bloomberg as a Software Developer according to 1 Glassdoor interviews include:
Phone interview: 50%
Background check: 50%
Here are the most commonly searched roles for interview reports -
I applied online. I interviewed at Bloomberg in Feb 2017
Interview
First round was a phone interview with a live coding session. The interview started with a "Why Bloomberg?" question followed by two programming problems that were fairly easy. The interview lasted around 50 minutes.
I applied online. I interviewed at Bloomberg (Jersey City, NJ) in Feb 2017
Interview
It is a Phone interview, takes about 45 mins, first asked me about my background and project on my resume and then let me to write answer a easy code question
I applied online. I interviewed at Bloomberg (New York, NY) in Mar 2017
Interview
I applied online and was asked to schedule a technical phone interview. The phone screen was 1 hour long and was on hackerrank. It consisted of 1 coding question and 1 design question. Next I was the onsite interviews. It was scheduled almost a month later and was in the NY office. It consisted of 2 technical rounds after which I hear were the HR interviews which I did not proceed to.
Interview questions [1]
Question 1
In the phone screen I was asked to add two numbers in linked lists and return the result as a linked list. The second question was about how I would design a system that stored stock prices.
In the onsite interview, I was asked a little about my projects. The coding question was quite simple - to sort intervals (messed up the sorting part). They discussed in depth the different sorts that could be used, their time complexities, when a particular type of sort would be more beneficial etc. The 2nd technical round was more related to data structures. I was asked to design a hashmap with a worst case retrieval time of O(n).