Bloomberg L.P.

  www.bloomberg.com
  www.bloomberg.com

Bloomberg L.P. Financial Software Developer Interview Questions

Updated Nov 28, 2014
Updated Nov 28, 2014
79 Interview Reviews

Interview Experience

Interview Experience

69%
26%
4%

Getting an Interview

Getting an Interview

64%
17%
16%

Interview Difficulty

3.5
Average

Interview Difficulty

Hard

Average

Easy

79 Candidate Interview Reviews Back to all interviews

Sort: Popular Date Difficulty

 

Financial Software Developer Interview

Anonymous Interview Candidate
Anonymous Interview Candidate
Application Details

I applied through college or university – interviewed at Bloomberg L.P..

Interview Details

Company came to school career fair. Was contacted a few weeks after and was called for an on-campus interview. After the first interview, I was invited for another on-campus interview the next day (they flew from NY). Then I was flown to interview at HQ in NY and quickly thereafter got an offer.

Interview Questions
  • Was expected to code and debug on a laptop.   View Answer
Accepted Offer
Positive Experience
Difficult Interview

Other Interview Reviews for Bloomberg L.P.

  1. 7 people found this helpful  

    Financial Software Developer Interview

    Anonymous Interview Candidate
    Anonymous Interview Candidate
    Application Details

    I applied through college or university. The process took 3 daysinterviewed at Bloomberg L.P..

    Interview Details

    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
    • 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.   View Answer
    • 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.   View Answers (3)
    Accepted Offer
    Positive Experience
    Average Interview
  2. 2 people found this helpful  

    Financial Software Developer Interview

    Anonymous Interview Candidate
    Anonymous Interview Candidate
    Application Details

    I applied online. The process took 4 weeksinterviewed at Bloomberg L.P. in October 2014.

    Interview Details

    Applied Online. Scheduled 1st phone interview within two weeks of applying. Scheduled on-site a week later. Heard back about an offer two days after the on-site.

    Very satisfied with the entire process. HR was fast and competent.

    Phone screen consisted of two questions on HackerRank. First question was coding a typical technical question. Second question was a design question, no code.

    Onsite was an onsite-day so there were many applicants interviewing at the same time (you still interview by yourself though). Four rounds in total. First two are 2:1 with engineers and very technical. You write code on pads of ~6x8 paper (wouldn't have been my medium of choice). 3rd round is a 1:1 with a senior engineer/engineer manager(?); no coding. 4th round is with HR.

    Interviewers were very friendly and willing to nudge you if it looked like you were getting stuck. They all seemed very intelligent which was a bit intimidating. The questions were also interesting and fun. First round was more algorithms and second round more data structures but that may have just been a coincidence.

    Interview Questions
    Accepted Offer
    Positive Experience
    Average Interview
  3. 28 people found this helpful  

    Financial Software Developer Interview

    Anonymous Interview Candidate in New York, NY
    Anonymous Interview Candidate in New York, NY
    Application Details

    I applied online. The process took 2+ monthsinterviewed at Bloomberg L.P. in June 2014.

    Interview Details

    From the online application (bloomberg website) to the phone interview took around 4 weeks (a first interview was scheduled within 2 weeks but the interviewer didn't call so we rescheduled). The phone interview was quite straightforward and I was asked the following questions
    1- Kind of a strange question. Generate all 3-digit combinations of 1-9 but not repeats in the sense that if you have 123, then 231, 321, etc. are not allowed. [nested for loops]
    2- Reverse a given sentence (no use of library methods, arbitrary spaces between words). Make it faster. [start at the end and find and print words one-by-one].
    3- You are given a 3L and a 5L container and unlimited supply of water. How to make 1L?[I found a longer solution but the short on is pour 3L into 5 twice.]
    4- A program/algorithm which given mL and nL buckets figures out how (if possible) make kL. [we discussed the solution and the interviewer was nice and gave me a hint. Its a DP problem].

    The next day, I received and invitation for on-site interview. The travel schedule part was straightforward and convenient.
    I was invited to the NY office. There was a group of around 30 people like me. They hold you for a few minuts to issue a security badge. Then there is a tour about all the 31 or so aquariums and fishes at bloomberg. Eventually, there is breakfast and then the interviews come find you. There is 4 rounds of interview. Rounds 1-2 are technical, 3 is management, and 4 is HR.
    Some questions I remember:
    1- Find shortest path on a chessboard from low left corner to top right. You can move right and top only and some cells are inaccessible (DFS).
    2- You have sorted arrays A and B with sizes m and n. Assume at the end of array "A" you have "n" empty slots. How to merge with minimum number of operations (start at the end instead of beginning). Prove it works (induction).
    3- Some runners running in a field with some "k" sensors. We get events of runnings locations. How to print the top "m" runners? (array of lists or hash table of lists depending on the location of the sensors. each list is one sensor). Some questions on how to identify the ordering within each list.
    4- CPU Cache implementation. How to implement the least frequently used procedure.
    5- Scheduling some jobs over "m" servers. Centralized vs distributed implementation? How to implement.

    The management interview was interesting and I liked the two managers. HR was fine too. I did not do any negotiations.

    Interview Questions
    • The chessboard problem. I first mentioned BFS and use of a Queue but the interviewer kept asking about some data structure with less memory that I could extract due to the simple structure of the graph. I did not understand what he meant. I eventually mentioned DFS and proved it works uses less memory.
      The cache problem took a long time. I kind of though I failed it at some point. I had no prior knowledge of the topic since I am not a CS guy. I eventually, used an array to store the access time to different items and O(n) search through it to find the least frequently used one. The interviewer did not raise the complexity. He wanted me to write code on a paper (which is hard, esp. in C).
       
      View Answer
    Negotiation Details
    I did not do any negotiations. I accepted the offer for some time in the future since I need to resolve the visa part.
    Accepted Offer
    Positive Experience
    Difficult Interview
  4. Is this helpful? The community relies on everyone sharing – Add Anonymous Interview Review


  5.  

    Financial Software Developer Interview

    Anonymous Interview Candidate
    Anonymous Interview Candidate
    Interview Details

    One phone interview and one on site (3 interviewers) plus HR review. Three interviewers are two developer and one manager. Then you get the offer and they do all background checks etc.

    Interview Questions
    Negotiation Details
    Not much negotiation room for junior hire
    Accepted Offer
    Negative Experience
  6.  

    Financial Software Developer Interview

    Anonymous Interview Candidate
    Anonymous Interview Candidate
    Application Details

    I applied through college or university. The process took 2+ weeksinterviewed at Bloomberg L.P..

    Interview Details

    C++ questions, like sizeof implementation, swap code. Simple questions but they expect thorough answers.
    Maximize profit given a sequence of daily prices by buying and selling only once each.
    Describe your most complicated work.
    One interviewer tried to test my bias for action and if I have an urgency to do something quick and finish the goals

    Interview Questions
    Negotiation Details
    non-negotiable
    Accepted Offer
  7. 13 people found this helpful  

    Financial Software Developer Interview

    Anonymous Interview Candidate
    Anonymous Interview Candidate
    Application Details

    I applied online. The process took 2+ monthsinterviewed at Bloomberg L.P. in December 2013.

    Interview Details

    Applied Online...

    Phone Interview.. Not difficult.
    Question 1: Why make data members private and access them using getter and setter methods when you can access them directly by making them public.
    Question 2 : Given stock prices of n days. Find when to buy and when to sell stock in order to gain maximum profit
    Question 3 : Given an array of size greater than 'x' and a range 0 to x . Find duplicate elements in the array. Hint. You can destroy the array but the solution should use O(1) space and O(n) time where n is the size of the array.

    On Site Interview:

    Interview 1 :
    Interview with 2 software developers
    Started with some questions related to my projects
    Q1 : Diamond Inheritance Problem in C++. Use of virtual keyword. And how are things handled internally. Basically checked my understanding of vtable

    Q2 : Can you use virtual keyword with destructors?

    Q3 : Given heads of two linked lists. Find if the two linked lists intersect.
    Solution should not use extra memory.

    Q4 : Reverse linked list. Tested concepts of double pointers, pass by value and pass by reference.

    Interview 2 :
    Interview with 2 software developers
    Q1 : In what case would you use BST over a hash table..
    Q2 : Insertion in BST
    Q3 : Find 'k'th smallest element in BST. What extra information would you require here
    Q4: Given a string which has a lot of spaces beween words . Remove these extra spaces in the string
     eg: " I love New York " --> "I love New York"
    Q4 : You get an input in the form [2 lowercase characters , A number] .. eg [aa,10] , [bd, 12]..
    Given a two letter input, find the last 10 numbers associated with the string..
    Design a data structure to implement this without using STL. Basically I was asked to design a hash function.

    Interview 3 :
    Interview was with a project manager

    Q1 : Find the first distinct element in an array
    Q2 : C++ does not have byte datatype. How would you create this datatype.
    Q3 : Lets say I have a code currently executing on my machine. I overwrite the code with a newer version. But the older version is still executing. Why do you think this is happening.

    Interview 4 :
    Interview with HR
    General HR Interview

    Interview Questions
    • Given heads of two linked lists. Find if the two linked lists intersect.
      Solution should not use extra memory.
       
      View Answers (7)
    Accepted Offer
    Positive Experience
    Difficult Interview
  8.  

    Financial Software Developer Interview

    Anonymous Interview Candidate in Stanford, CA
    Anonymous Interview Candidate in Stanford, CA
    Application Details

    I applied through college or university. The process took 3 weeksinterviewed at Bloomberg L.P. in January 2014.

    Interview Details

    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
    • Given a directional graph, where each node contains a letter, and a lexicon, find all words in the lexicon that appear in the graph.   Answer Question
    Negotiation Details
    Was a freshman, so didn't negotiate. Pay was more than generous, and more than Google, Facebook, etc. were paying any of my classmates.
    Accepted Offer
    Positive Experience
    Average Interview
  9.  

    Financial Software Developer Interview

    Anonymous Interview Candidate in Raleigh, NC
    Anonymous Interview Candidate in Raleigh, NC
    Application Details

    I applied through college or university – interviewed at Bloomberg L.P. in November 2013.

    Interview Details

    Scheduled oncampus interview and two ppl interviewed for one hour.

    No introduction of themselves,no introduction of the position for which I was being interviewed and looked uninterested.

    Asked two coding questions and were continously emphasizing on lowering down the complexity.

    Interview Questions
    • Remove consecutive duplicates in a string inplace and less than O(n)   Answer Question
    Reasons for Declining

    Not interested in profile

    Declined Offer
    Negative Experience
    Difficult Interview
  10. 3 people found this helpful  

    Financial Software Developer Interview

    Anonymous Interview Candidate
    Anonymous Interview Candidate
    Application Details

    I applied through college or university. The process took 3 weeksinterviewed at Bloomberg L.P..

    Interview Details

    Bloomberg came to my school career fair. I chatted with a representative, ended up getting an interview out of it. The first two interviews were both about an hour technical. The first one had a few questions about prior experience, while the second one was over an hour straight of writing code. The third interview was half technical and half behavioral. They were very timely in getting back to me about the interviews.

    Interview Questions
    • If you have two very large integers, how do you calculate the product if the product is too large to be represented by your computer program.   View Answer
    Accepted Offer
    Positive Experience
    Average Interview

Work at Bloomberg L.P.? Share Your Experiences

Bloomberg L.P.

 
Click to Rate
or

The difficulty rating is the average interview difficulty rating across all interview candidates.

The interview experience is the percentage of all interview candidates that said their interview experience was positive, neutral, or negative.

Your response will be removed from the review – this cannot be undone.