Status: New grad, BS CS State School
Position: Software Engineer at Bloomberg
Location: New York, NY
- Technical Phone Screen (45 Minutes)
The first interview was a technical phone screen. I was asked to implement a vector in C++. I ended up using a dynamic array approach where I increased the array size as the vector got full. Then I was asked a few standard behavioral questions.
I passed and went on the on-site interview. - On-Site Interview
At the on-site interview I was taken to a room with 2 engineers. The first question was an arrays question. I was given an array and a function. The function was any function out there. My job was to find all equivalence classes of that function. So for example if the function is modulo 3 and the given array is [1,2,3,4,5,6,7,8,9,10], then the equivalence classes are [1,4,7,10],[2,5,8],[3,6,9]. The goal was to do this in O(n) at best case.
The second question was graphs. Given an undirected graph, find all paths from a target node to source node.
The third question was on strings. The question was to find the largest palindrome substring within a string.
I did not make it to the HR round, as I couldn’t answer the graphs question.