Bloomberg L.P. Finance Intern Interview Questions

115 Interview Reviews

Interview Experience

Interview Experience

70%
18%
10%

Getting an Interview

Getting an Interview

42%
23%
0%

Interview Difficulty

3.1
Average

Interview Difficulty

Hard

Average

Easy

115 Candidate Interview Reviews Back to all Interviews

Sort: Popular Date Difficulty
  1. Helpful (1)  

    No Offer
    Neutral Experience
    Average Interview

    Application

    I applied online. The process took 3 weeksinterviewed at Bloomberg L.P. in December 2013.

    Interview

    Applied online, got a mail asking for time-slots to set up an Telephonic-Interview. Mainly concentrated on data-structures and algorithms. Initially asked about my courses, what is my favourite, why. Questions: 1. Given a String and a character, return a the given String after removing the all occurrences of the given character in it. 2. Given a Binary tree, return if the given tree is a Binary Search tree or not.

    Interview Questions

    • Asked about Databases, Primary keys etc. which I was not very conversant with   Answer Question
  2.  

    No Offer
    Positive Experience
    Easy Interview

    Application

    I applied online – interviewed at Bloomberg L.P. in December 2013.

    Interview

    took about 2 months. had one phone internview wich I thought went well. first asked how to reverse an array which I answered in one sentence so he said maybe that is too easy so he instead asked to write a function that takes in a string and prints the occurences of each character I think. I siad to use a hash map with a count related to each character he asked what are the benefits of using a hash map. Got a rejection email about a week later

    Interview Questions

    • write a function that takes in a string and prints the occurences of each character. ;   1 Answer
  3. Helpful (3)  

    No Offer

    Application

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

    Interview

    Career Fair to on Campus interview. There were two interviewers. One was nice and one was rather apathetic. 10 min of niceties and then the technical questions.

    Interview Questions

    • 1. Given a list of strings return all strings that are ambigrams of each other. 2. Implement a linked list in C++.   Answer Question
  4. Is this helpful? The community relies on everyone sharing – Add Anonymous Interview Review


  5.  

    No Offer
    Neutral Experience
    Average Interview

    Application

    I applied through college or university. The process took 1 dayinterviewed at Bloomberg L.P..

    Interview

    It was good, recruiters were friendly..normal questions like 1. how would you remove duplicates in a string 2. how would you find that a linked list is merged or not

    Interview Questions

    • how would you find that a linked list is merged or not   Answer Question
  6. Helpful (1)  

    No Offer

    Application

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

    Interview

    Applied through career fair booth and went through 3 rounds of on-campus interviews. First two were technical and mainly tested C/C++ and algorithms questions. Last interview was an HR interview and asked pretty general stuff about previous projects and obstacles overcome.

    Interview Questions

    • Find the largest k numbers in an enormous array of numbers. You cannot sort the array.   Answer Question
  7.  

    No Offer
    Average Interview

    Application

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

    Interview

    Went through two rounds of interviews. Not hard. Just know your basic programming stuff, especially linked lists and beyond. e.g. create a queue class using linked list

    Interview Questions

  8.  

    Declined Offer

    Application

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

    Interview

    I talked to a recruiter during my school's career fair and was called about a week later regarding an interview. I had 2 on-campus interviews, after which I was given an offer. The first interview consisted of two algorithmic questions and one puzzle, and the second interview consisted of one algorithmic question and HR questions.

    Interview Questions

    • Given a set of intervals, find the maximum number of intervals that overlap at a single time point.   Answer Question
  9. Helpful (3)  

    Financial Software Developer Intern Interview

    Anonymous Employee in New York, NY
    No Offer
    Positive Experience
    Average Interview

    Application

    The process took a weekinterviewed at Bloomberg L.P. (New York, NY) in October 2013.

    Interview

    I was asked three algorithm questions. I got them, but with help. The interviewers asked me to code these on paper in any language I wanted. I choose C++; they were very exact in what they wanted. Most of the questions seem to be on this website and others so preparation with those questions is a good idea ...

    Interview Questions

    • 1) Find the intersection of two arrays as a set. 2) Find the mirror or a binary tree. 3) Find the first non unique character in a stream of potentially infinite data.   2 Answers
  10. Helpful (1)  

    No Offer
    Positive Experience
    Difficult Interview

    Application

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

    Interview

    Applied through a career fair on campus, and had an on-campus interview the next day. The interview lasted for 45 mins, including a 5 minute introduction and mainly two technical questions.

    Interview Questions

    • 1. How will you find the max and second max of an array of n elements? How will you find the largest k elements? 2. How will you properly shuffle a deck of cards?   1 Answer
  11.  

    No Offer
    Neutral Experience
    Difficult Interview

    Application

    I applied through college or university. The process took a weekinterviewed at Bloomberg L.P. in October 2013.

    Interview

    I had an on campus interview that resulted frome career fair. I attended my interview. The first questions I was asked was very obscure. I eventually ended up answering it, but it was very atypical (see below). Two more questions followed, the specifics of which I cannot recall. I received a call about an hour later asking for a round 2 interview the next day. I attend this interview and flawlessly answer all of the questions asked (relatively short, and talked about my previous experience with algorithms). About a week after the interview, I received an email saying that I did not get the position. All in all, I'm not too disappointed, as I wasn't incredibly interested in interning at the company. However, I'm a little surprised that I was rejected despite being called back for a round two, and performing very well at that. The first interview seemed to go well too, as the interviewers seemed impressed. Anyway, perhaps I was just overly optimistic.

    Interview Questions

    • There are two mars rovers on a 2 dimensional plane (Mars?), as well as 2 sensors. One rover is between the two sensors, and the other is outside. Write a program using only forward, backward, and onSensor() : boolean, to ensure that the rovers will collide.   1 Answer

See What Bloomberg L.P. Employees Are Saying

 Former Analytics Representative in New York, NY

Pros: “A lot of great training if you don't have a finance background Company treats employees well Offices located across the world”“A lot of great training if you don't have a finance background Company treats employees well Offices located across the world” – Full Review

Don't Miss Out On a Job You Love
Upload a resume to easily apply to jobs from anywhere. It's simple to set up.

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.