Software Developer applicants have rated the interview process at Bloomberg with 4 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 70.4% positive. This is according to Glassdoor user ratings.
Candidates applying for Software Developer roles take an average of 60 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 38 days.
Common stages of the interview process at Bloomberg as a Software Developer according to 1 Glassdoor interviews include:
Phone interview: 100%
Here are the most commonly searched roles for interview reports -
I applied online. The process took 4 weeks. I interviewed at Bloomberg in Mar 2017
Interview
Submitted a CV online. Took almost a month to receive a response.
In the response e-mail they ask for your schedule and to provide dates for a technical phone interview. Be careful here because they will confirm the date 2-3 days before it happens, so you should start preparing straight away.
You can choose between C++, Java, and some other languages. The length of the whole interview is around 1 hour.
On the phone:
1) Tell me about yourself, your projects, etc
2) Why Bloomberg?
3) Two technical questions on a shared editor
This was a pretty bad experience. The interviewer seemed like he wanted me to complete the technical questions as fast as possible and didn't really care about anything else. During the technical stage I was describing my thought process but the interviewer was almost completely silent - I even had to ask if he was still on the phone!
My performance was average. On the first question, there was a small hint from him near the start which guided me to the optimal solution. I ended up getting most of it done but it was definitely a struggle and there were a few mistakes. The second question was much easier. I completed the question without any assistance and provided the optimal solution in around 10 minutes.
It was very uncomfortable overall. Did not hear from them again.
Interview questions [1]
Question 1
They were both Leetcode questions. Probably medium difficulty or easy.
I applied through an employee referral. I interviewed at Bloomberg in May 2017
Interview
Referred by a friend. A recruiter contacted me and set up a screen interview on hackerrank. This is a 45min interview, starting with why Bloomberg, and why do you change from academia to industry. Then asked me two algorithm questions.
Interview questions [1]
Question 1
1. return the maximum product of 3 numbers in an array
2. print out the pairs of a number and the nearest greater number to its right in an array. Example: given [1,2,5,2,6], print out (1,2), (2,5), (5,6), (2,6)
I applied online. I interviewed at Bloomberg (Londra, Inghilterra)
Interview
I applied online through careers section of Bloomberg. The application was for entry level software engineer at Bloomberg London site. I needed to upload my resume and cover letter. My language of choice for the interview was C/C++. I had one phone interview (1:1) and two video interview (2:1). Following this, I was called for onsite interview at London office and had three round of interview there (2-tech, 1-HR). Following onsite interview I had a final interview with tech head at London site.
Interview questions [1]
Question 1
1.Pointer basics.
2.Bracket matching:
/*
"(aa)bb" -> true
"[ aa [ bbb ]" -> false
"aa } bbb { c" -> false
"aa [ bb () ]" -> true
"[aa { ] cc } ]" -> false
*/
3. Design and implement a web browser which supports the functionality that at any given instance you can efficiently tell the top 5 visited websites on basis of number of visits. This question was a variant of LRU cache and it can be optimally implemented using a map and doubly linked list.
4. Run length encoding of string. See below for example:
aaaaabbbccd → a5b3c2d1
xyz → x1y1z1
5. Merge overlapping intervals. See below for example:
[1,3] [2,5] [8,9] → [1,5] [8,9]
[1,3] [2,6] [4,99] → [1,99]
6. Given a binary tree, tell whether this is a valid BST.
7. Implement a generic hashmap in C++. Make sure to use templates, good hash functions and be ready to discuss design to handle collisions.
There will be behavioral questions. Make sure to prepare for the question : Why Bloomberg?