1. 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, increasing the array size as the vector filled. Then, I was asked a few standard behavioral questions.

I passed and advanced to the on-site interview.

1. On-Site Interview At the on-site interview, I was taken to a room with two engineers. The first question was an arrays problem. I was given an array and a function. The function could be any function. My job was to find all equivalence classes for that function. 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], and [3,6,9]. The goal was to achieve this in O(n) time at best.

The second question involved graphs. Given an undirected graph, I needed to find all paths from a target node to a source node.

The third question was on strings. The task was to find the largest palindromic substring within a given string.

I did not make it to the HR round, as I couldn't answer the graphs question.