Microsoft

24-07-2012 Round 1 30 quantitative questions + 20 programming aptitude questions (1 hour, online)

25-07-2012 Round 2 3 programs (online):

1. Enumerate the given string to ascending order without repetition. Input: accommodate Output: acdemot
2. Given a sorted array in which a part of the sub-array is reversed. Fix it. Input: 1,2,3,4,7,6,5,8,9 Output: 1,2,3,4,5,6,7,8,9
3. Convert a sorted doubly linked list to a BST.

25-07-2012 Round 3 3 programs (written):

1. Given an array and a number N, determine if there are tuples with a difference equal to N.
2. Insertion in a sorted circular singly linked list.
3. Given a node in a BST, print the leftmost node at the same level as the given node.

30-07-2012 Round 4 2 programs (written):

1. Given a linked list with a next pointer and an arbitrary pointer, clone it.
2. Decimal to Hexadecimal conversion.

Hereafter, all rounds are face-to-face with HR.

30-07-2012 Round 5 (OS)

1. Problems related to swap space management.
2. Thrashing.
3. Multi-threading concepts.
4. Code using semaphores.
5. Test cases for the above code (using diagrams) and explanation.
6. Discussion about your "Final Year Project".

30-07-2012 Round 6

1. Given a BST with 2 node values swapped. Find and fix it. (Note: Include all test cases).
2. Keyboard inputs are given one by one. After getting the 10th input, print all the inputs in reverse.
3. Intersection point of two linked lists.

30-07-2012 Round 7

1. Given a graph and two nodes, find the number of distinct paths between those two nodes.

30-07-2012 Round 8

1. Majority element in an array. (Given an array of length n, find if an element occurs at least n/2 times).

The interview was over. He said that I did well and that I was most likely to be hired. I was very happy.

In ten minutes, the HR department said that I was selected.