I applied through the campus career fair as well as online. I'm not sure which channel led to my call.

I was asked to complete an online assessment, which was an online coding sample.

There were two questions in the assessment, and I was able to solve one of them.

The result of the coding sample did not affect the interview in any way.

After that, I had two back-to-back phone-screen interviews.

You have two sorted lists, A and B. Find the kth smallest sum, where a sum is defined as a + b, such that 'a' belongs to list A and 'b' belongs to list B.

For example, if A = [1, 2, 3] and B = [4, 5, 6], the list of possible sums is [5, 6, 6, 7, 7, 7, 8, 8, 9]. Hence, the 5th smallest sum is 7.

Given a list of integers, return k such that 1, 2, 3, ..., k are present in the list.

For example, given the list [2, 3, 1, 4, 6, 8, 7], return 4, as 1, 2, 3, and 4 are present in the list.