They started with a telephonic screening. The screening was just to make sure that you were the candidate described in the resume. They asked about recent projects and basic Computer Science fundamentals.

Next was a telephonic interview conducted by a recruiter. She asked for details about my projects, some Computer Science questions, and a coding problem. I was asked to reverse a linked list.

Then, I was invited to on-site interviews at Microsoft Redmond, WA. I had three interviews, and each consisted of a series of questions regarding my projects, some behavioral questions, some testing questions, and one coding question.

Find a recurring element in a linked list of Unicode characters. If a Unicode character(s) is found to have a duplicate, delete that repeating node and adjust the list. The constraint was to not use any extra memory.

Using recursion to traverse a binary tree.