My first interview was at the university. They asked a matrix question from the "Cracking the Programming Interview" book.

Afterwards, they flew me to Redmond for the final round.

They literally paid for everything:

• Hotel
• Flight
• Rental car
• Taxi
• Space Needle ticket
• Meals, and so on.

During the day, I had five interviews back-to-back. The questions were very standard but covered almost all data structures and algorithms. Still, they were much easier than the ones I got from Google.

Overall, the interviewers were very nice and helpful. They made the interviews seem like workplace discussions rather than tests, so I was very relaxed and confidently talked my way through them.

I got an offer within a week.

Questions can mostly be found on GeeksforGeeks. The topics include binary trees, recursion, 2D arrays, suffix tries, hashing, etc.

1. Implement "atoi".
2. The skylines problem.
3. Given the endpoints of two lines in a 2D dimension, check if they intersect. (This is more of a math problem, but I just coded it up in C++).
4. Binary tree modification: Make all parents' values be the sum of their direct children.

There are more, but I can't remember.