I went to the Bloomberg table at the campus career fair. They asked me a simple programming question, which I correctly answered. After that they had me schedule an on-campus interview for the next week. The interview was 2 rounds, separated over two days. The first round was more technical, I was interviewed by two software developers who asked me questions about my programming background before getting into the technical questions. The next day I talked to a single person, where they asked me one technical question and a lot of basic questions, such as why do you want to work at Bloomberg? etc. Overall, the experience was good, although the interview area seemed to be a bit out of order and hectic.
Interview questions [1]
Question 1
Give an algorithm that will calculate and print out all possible combinations of quarters, dimes, nickels, and pennies in order to get a dollar.
I applied through college or university. The process took 3 weeks. I interviewed at Bloomberg (Stanford, CA) in Jan 2014
Interview
Met at a campus career fair, scheduled for technical interview the next day. Was flown to New York for two more technical interviews (I was actually exempted from these, but others had them) and HR and senior manager interviews; offered the job within a couple days of interviews. Interview process was smooth and communication was excellent; free trip to NYC didn't hurt either. HR at Bloomberg is brilliant and runs well; love the people there.
Interview questions [1]
Question 1
Given a directional graph, where each node contains a letter, and a lexicon, find all words in the lexicon that appear in the graph.
I applied through college or university. The process took 3 days. I interviewed at Bloomberg
Interview
Had four on-campus interviews following a career fair--three technical and one with an HR guy. I was allowed to use any language. There were six questions. Two were about implementing some common function, such as a String class constructor. One required partitioning a list around a given element. One required merging two schedules that might overlap in some parts into one schedule. The last two are described below.
Interview questions [2]
Question 1
You're given a binary tree--not necessarily complete or proper--and you need to give each node a "friend" pointer that points to the node to its right in the tree. This node is on the same level but is not necessarily a sibling, which makes the problem a little tricky. The friend pointer of the node farthest to the right on each level should be null.
You're given two arrays of the same size filled with positive integers, and an integer 0 <= N <= 255. You need to determine whether N can be written as the sum of some number from the first array and some number from the second array.