The interview on university campus was somewhat disappointing; the interviewer seemed bored and distant. They asked a question regarding string manipulation that wasn't particularly difficult.

The interview in Redmond was alright. I really enjoyed the algorithm problems.

The team was great. I dressed in business (very) casual; most of my interviewers were in jeans and a t-shirt, though one was not.

They didn't care what language I implemented my algorithms in, so I would generally use pseudocode initially and then drop into various languages to see what the interviewers were familiar with.

Very professional overall.

The on-site interview consisted of five technical questions. Code was required for four of the five:

• Write a small parser for strings that determines whether a string is a sequence of space-separated words.
• Write an API for working with a specific type of document.
• Given an undirected cyclic graph, find all paths from A to B without cycles.
• The delivery of the fourth question was very confusing – basically, they wanted me to implement a stack as a means of counting parentheses.
• Given a function prototype and a return value, hypothesize regarding 'what happened'.

The on-campus interview was a single technical question; the interviewer was extremely bored:

A. I've forgotten this question; it was a relatively trivial string analysis problem.