I applied through a college career fair.

First, I had to do a simple test about sorting and nodes. I believe this result did not affect my application process.

Then, I was scheduled for a technical interview. You meet with your interviewer, and apparently, you are supposed to solve two problems. I barely finished one. I wasn't expecting a DP problem, to be honest. My interviewer told me he wasn't looking for an exact solution, just to see how I handled the problem and if I could provide one possible solution.

I thought I didn't do okay because I didn't solve both problems, but after two weeks, I was scheduled for an interview via Skype. It was one problem, and they were looking for a specific answer, which I was able to provide.

Then, I was contacted by HR, and they told me I got in! But I haven't accepted it yet.

Matrix mxm with 0s and 1s. I was asked to find the maximum sequence of 1s that formed rectangles.

I found out later by another recruit candidate that the other question was a link reversal.

There are three boxes: one contains only apples, one contains only oranges, and one contains both apples and oranges. The boxes have been incorrectly labeled such that no label identifies the actual contents of the box it labels. Opening just one box, and without looking inside, you take out one piece of fruit. By looking at the fruit, how can you immediately label all of the boxes correctly?

I was asked to check whether two lists intersect at some point.