I applied through a recruiter. The process took 1 day. I interviewed at Volt Information Sciences (Redmond, WA) in Feb 2010
Interview
Pretty standard fare. Phone interview. Coding questions. Interview loop involved 4 people as I recall.
Interview questions [1]
Question 1
Write an algorithm which takes as input a node and returns whether or not the tree structure contains a loop. Assume that a node has at most two pointers to children, but no pointers to parents.
I applied through a staffing agency. The process took 5 days. I interviewed at Volt Information Sciences (Redmond, WA) in Jun 2008
Interview
After talking with the recruiter, they set me up with 2 interviews on-site at Microsoft. Two days after both interviews, I heard back from the recruiter with an offer, which I accepted the next day.
Interview questions [1]
Question 1
Write a function to determine if two binary trees contain the same data & structure.