Spoke with a recruiter on campus and then set up times to do a phone screening. The first phone screening didn't go too great, so they gave me a second phone screen. Both were 45 minutes. Other candidates who did well moved on to the onsite after only one phone screen, though. I didn't pass the second phone screen and didn't move forward.

Both phone screens started with basic questions that then were turned into dynamic programming questions. About 20 minutes into the interview (after introductions, discussion of past work, and then the easy problem), they unveiled the DP problem with less than half an hour left.

I felt the questions were a little too rigorous for first-round phone interviews in the time span given, and it doesn't reflect too well on their recruitment process. Other candidates were not asked DP questions over the phone.

Otherwise, the recruiter is very kind, and both of my interviewers were pleasant to speak with.

Dynamic programming coin picking. Each player takes turns picking from a collection of coins. The game ends when all of the coins have been claimed, and the winner has the highest value. Program this game, keeping in mind that each player wants to win.

Find the least common ancestor of two nodes on a binary tree (not a binary search tree).