I submitted an application online and was contacted within a couple of days.

I did a phone interview, and within two days of the phone interview, I was contacted and asked to come on-site for a series of interviews.

I had three one-on-one interviews with various employees: two were an hour long, and one was 1.5 hours long (included lunch).

Although I wasn't offered a position, the trip was a great experience. Everyone was incredibly friendly, and I got to see Seattle/Redmond courtesy of Microsoft.

How would you test a calculator that is going to be used by elementary school-aged children?

Implement enqueue and dequeue using stacks.

Given an unsorted array of integers, sort them in such a way that all negatives come first, followed by zeroes, followed by all positives.

Example: 5, -6, 8, 0, 4, -10, 11 could become -6, -10, 0, 8, 4, 11 (does not have to be sorted into increasing order).

What is the run time of this? Can we reduce the run time, if so, how (implement the new way)? Doing black-box testing, how can we determine the run time? How can we determine if we have a memory leak?

Given a string (understood to be a sentence), reverse the order of the words.

Example: "Hello world" becomes "world Hello"