Nice experience so far
Nice experience so far
You will get technical work to do here. The workload is a bit much, but it's fine as long as you have challenging jobs to do. Some work pressure is there.
Work-life balance is somewhat not easy, as I've seen in my previous companies. Managers always keep the pressure on for the job. But all are hardworking people, and it inspires me as well to excel.
Was this helpful?
Bloomberg LP Interview Questions
Bloomberg LP Interview Experiences
Senior Software Engineer
Two phone interviews with algorithm and data structure problems, followed by an on-site interview in New York City. It was a full-day interview, and I met with 10 people.
Senior Software Engineer
Resume submission, followed by a technical phone interview with a team member. I was asked two data structure-based questions, one easy and one medium LeetCode question. The interview with the team member did not go smoothly. The interviewer seemed
Senior Software Engineer
1st Phone Interview: - Given an array of numbers and a sum k, find a pair in the array that sums to k. - Provide an algorithm to print a paragraph of text based on the screen size. 2nd Phone Interview: - Find the m-th last element in a linked list
Senior Software Engineer
New York, New York, United StatesMarch 1, 2018Two phone interviews with algorithm and data structure problems, followed by an on-site interview in New York City. It was a full-day interview, and I met with 10 people.
Senior Software Engineer
New York, New York, United StatesMay 1, 2021Resume submission, followed by a technical phone interview with a team member. I was asked two data structure-based questions, one easy and one medium LeetCode question. The interview with the team member did not go smoothly. The interviewer seemed
Senior Software Engineer
New York, New York, United StatesOctober 1, 20141st Phone Interview: - Given an array of numbers and a sum k, find a pair in the array that sums to k. - Provide an algorithm to print a paragraph of text based on the screen size. 2nd Phone Interview: - Find the m-th last element in a linked list
