A telephone interview, asking non-technical questions, was offered. An on-site interview followed.

There were four rounds. I thought I was doing well, but I failed.

All questions were technical. One impression is that Microsoft Office people like loops and very much dislike recursion.

Pancakes: Their size varies and they are put in a stack in random order. You have one operation called Flip(int[] pancakes, int k) to flip all pancakes from the top one to the kth pancake. Write a sort(int[] pancakes) method.

A rotated sorted array (e.g., 34512): Find the rotation count (in this case, 3 means rotated by 3).

Group of people: You can call Know(i, j) to ask if the ith person knows the jth. The return value is true (i knows j) or false (i does not know j). Find the person that everybody else knows but who knows nobody.