Initial Call: I was referred to a technical manager internally who contacted me directly. After a casual chat, he sussed out that I would need to brush up on data structures and algorithms and would call me back in two weeks. I picked up my algo/datastructures textbook and read through it, working through writing simple algorithms on paper during my commute.

Official Screener: During my official technical screening (figuring out whether they'll fly you out to Redmond or not), they asked me the standard linked list question – detect if there's a loop, etc. Then they asked me to create a system to organize a bunch of objects with different classifications. I ended up coming up with a Dewey Decimal System. I was also asked to find the common ancestor in binary trees.

On Campus: I got set up with somebody from HR as my first interview. I was told I could ask her anything to help me through my interview process. I asked her some random questions, like, "Should I not mention that my last project used Google APIs?" To which she replied that Microsoft respects any good technology, so just because they're competing, don't be afraid to talk about it.

Tech Interviews:

1. Write a function to list all prime numbers up to a maximum. Finished it in 15 minutes and was then asked to write test cases for it. I filled up one whiteboard.
2. Non-coding: I was asked to test a webpage with a single input box and a button.
3. Remove a character from a string. Test it.
4. Walk a binary tree, breadth first. Test it. (I ran out of time with this one).
5. My as-appropriate asked me a technical question because I didn't do so well on the last question. He asked to merge two linked lists. I answered it with no troubles.

My as-appropriate walked me out and waited for a shuttle with me while telling me all the Seattle spots to hit up.

HR got back to me a few days later, gave me an offer, and laid out the benefits of the job.

Advice: The interviewers are interested in solving the problem, but they're very interested in "how" you solve the problem. Talk out loud. Make sure you understand the question. Walk through an example first. Write out pseudocode, then code it for real. Organize your test cases in categories.

Walking the binary tree. I wasn't expecting this question and should have brushed up on my trees a bit more.