The process took 1 day. I interviewed at Microsoft (Seattle, WA) in Jan 2011
Interview
Submitted resume through college, got an on campus first round interview with a PM from the Office team. Got asked a basic question to reverse a string. Then got invited for an on-site interview. All paid for trip to Seattle. On interview day I went through 3 1-1 interviews each one hour long.
I applied online. The process took 1 day. I interviewed at Microsoft (Redmond, WA) in Nov 2010
Interview
applied through MS's website and got a phone interview. Asked about constructing a contact list management system. Writing some codes on a whiteboard websystem. Got an on-site interview with the Office group. All questions are about programming though there are warm-up behaviorial questions.
All programming questions are not demanding, but somehow tricky.Need to write codes on whiteboards. Can use any programming language you like.
Interview questions [2]
Question 1
Designing a process scheduling system that will call a certain process at a give possibility.
I applied through a recruiter. The process took 4 weeks. I interviewed at Microsoft in Oct 2010
Interview
Microsoft came to my college's career fair, and I dropped off my resume with them there after talking to the college recruiter for awhile. About a week later I had an on campus interview. The interview was a about 10 minutes of talking about myself and what I wanted to do, and then he asked me to code a question about strings in c.
After this they emailed me about to weeks later and asked me to come on site for the second round interview. They flew me up to Seattle all expenses paid, and put me up in a nice hotel. The actual second round was for me a series of 4 interviews. I was told there would be any number between 3-5 interviews depending on what they wanted to see.
The team I worked with seemed very laid back and relaxed. They didn't really seem to care whether I had the most correct answer or not as long as they could see what I was thinking. Overall it was a very positive experience.
A question about finding the shortest path between two points on a graph. With no information about where the second point was located in relation to the first problem.