I would like to contribute my Interview Experience at Bloomberg LP, New York.
Round 1-(Phone Interview)
This interview was easy. It lasted for around 45 minutes. First Interviewer Introduced himself and then had brief discussion on my resume and asked me questions like what made you to apply for Bloomberg. Then there were two coding questions
1) Find the first occurrence of a sub-string in a string and return the index of it if it is present.
2) Rotate a 2-d array of numbers in left direction (I solved this without using extra space).
Then he explained me his role and his team size.
Then I got a mail from hr after two days. I have been selected on site interview in new york in one month.
They provided me everything flight tickets, Hotel, taxi from airport to hotel and additionally they gave a 100$ gift card.
I reached the campus by 10 am and had a quick tour of the beautiful building.
Round 2 (Coding Interview)
There were Two interviewers in this round.
In a Linked List, each node has two pointers a skip node and next node.
This skip node can point to any node or it can point to null. We need to prove that the linked list is valid if a node’s skip pointer should not point to any node before the present node or itself or any node which is not present list(it can point to any other node in another list)
I have used a hash map with node reference as key and its index as value in first iteration.
Then compared with the skip pointer indexs according to above conditions.
You are a server in a wedding reception you need to serve two types a guests
1) Guest who asks for a specific type of food.
2)Guest who asks for a food with no preference.
But here the condition is you should always serve the oldest cooked food to the guests.
I have used hash map with key as food type and value as queue of items with timestamp.
you can get O(1) time complexity in first case and O(Food types) in second case.
Then they gave me a break for 15 mins had lunch in that period.
Round 3(Coding Interview):-
There were Two interviewers as well in this round
Question1:- Find nth Least Common Ancestor of two nodes in a binary tree Used recursive approach to solve this problem.
Question2:- There is a function in a class if it is called more than 1 million times in a second we need to print a error.
I have used queue to store the count of times it called in each milli second
value at index i is (count[i-1]+currcount- value at head of the queue) pop head if i-100>0 else count[i-1]+currcount
if this value is greater than 1 million we need to print an error.
In Brief I was counting for every milli second
I got a reject after 2 days.
Be prepared for Why Bloomberg?
Hope this experience might help some one.
- Bloomberg Interview | Set 3 (For Software Development Programmer)
- Bloomberg Interview Experience | Set 4 (Entry-Level Software Engineeer)
- Bloomberg Interview Experience | Set 5 (For entry level software engineer)
- Bloomberg Interview | Set 1 (Phone Interview)
- Bloomberg Interview | Set 2 (Video Conference)
- Bloomberg Interview Experience | Set 6 (Video Conference round)
- Bloomberg Recruitment Process
- Bloomberg Interview Experience | Set 7 (For SDE)
- Amdocs R&D Interview Experience | Set 7 (Graduate Software Engineer Trainee)
- BlueOptima Interview Experience (for graduate software engineer)
- Flipkart On-campus Placement Process 2020 Graduate
- Deutsche Bank Interview Experience | Set 2 (For Graduate Analyst)
- Deutsche Bank Interview Experience | Set 4 (On Campus for Graduate Analyst)
- Reliance Jio Interview Experience for Graduate Engineer Trainee
- Deutsche Bank Interview Experience | Set 8 (On-Campus For Graduate Analyst)
- What are the different job profiles offered to a Computer Science B.E./B.Tech graduate?
- Deutsche Bank Interview Experience(Graduate Analyst)
- Codenation Interview Experience (2020 Graduate)
- Deutsche Bank Interview Experience | Graduate Analyst ( On Campus FTE August 2020 )
- Deutsche Bank Interview Experience Graduate Analyst FTE(On Campus)
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.