I was doing a full day onsite interview. I was flown out to Seattle and put up in the Marriott.
On the morning of my interview, I checked in and was debriefed about the day's schedule.
I then had four interviews. I had lunch with my second interviewer before he asked any technical questions.
Given a binary tree (not necessarily complete), how would you do a traversal where at the first level you traverse from left to right, and at the second level you traverse from right to left, continuing to alternate at every given level, as if you're snaking through the BT?
Given a function that rolls a 6-sided die (numbered 1-6), how would you use it to return a number between 1 and 8 with fair randomness?
The following metrics were computed from 11 interview experiences for the Microsoft SWE role in Redmond, Washington.
Microsoft's interview process for their SWE roles in Redmond, Washington is fairly selective, failing a large portion of engineers who go through it.
Candidates reported having very good feelings for Microsoft's SWE interview process in Redmond, Washington.