The whole process was very smooth.

I first had a 30-minute interview on campus.

Two technical questions were asked:

• Reversing a linked list
• Least common ancestor in a binary tree

Then, I was flown to Redmond for an onsite interview.

I had four interviews, each for 45 minutes. They all asked sorting and string manipulation questions. They also asked me to come up with all test cases after I wrote my code.

There were no difficult or unexpected questions.

For instance:

• Sort an array with just two types of elements, optimize your algorithm.
• Find common letters in two strings and put them in a sorted order.
• Compare sorting algorithms.