Microsoft Interview | Set 9
I am Amit Dhaka. Following is my experience of MS IDC intern interview.
Date of Written: 9th September, 2012.
Date of Interview: 15 October, 2012.
No. of Rounds: 2 online exams + 4 rounds of PI
Type of Interview: Campus Interview.
1st Online Test: Time 1/2 hour
10 MCQs on basic Mathematical and Logical problems (mostly on P&C) and 5 MCQs on C programming.
2nd Online Test: Time 1 hour
3 programs were to be written.
- Given a no. in in form of base 4, you have to convert into base 2. The no. is given as a String. Do it in place.
- Given a sorted circular linked list. You have to insert an element in it.
- Two BST’s are given. You have to print common nodes that are present in both of them.
Interview Round 1: Time 40-50 minutes.
- Given a string, you have remove duplicates from it in O(n) time and O(1) space.
String can have ASCII characters. Try to use minimum extra space.
- Given a binary tree, check if it is balanced or not.
Interview Round 2: Time 25-30 minutes.
- Given two sorted arrays you have to merge them into single array.
- Given an array, find all the pairs of elements whose sum is k.
- Given an array, find a sub-array in which all pairs have their sum greater than k.
Interview Round 3: Time 30-40 minutes.
- I was asked to tell something about myself. I spoke only a minute then he started asking problems.
- Given an array, find the maximum contiguous sub-array with the maximum sum.
My query was can the array have negative values. He said yes.
- Given two BST’s, find the least common ancestor.
- Traverse a binary tree in a Zig-Zag order.
Interview Round 4: Time 30-40 minutes.
- First he asked me if I have any queries for him. I asked 3 questions as asking questions is a good gesture. You can ask that what kind of work will you be getting. Then he started with the problems.
- Given a sorted array and it has been rotated unknown times. You have to find minimum element of the array. I did in O(log n).
- He asked about the test cases for spell checker of MS Word.
Then he asked questions related to my resume. My advice will be that you don’t write anything by which you can be doubted. Be confident about what you have done. If there is one thing you are good at then it is enough.
I was lucky, and got the intern!!
Many Many congratulations to Amit Dhaka. If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks