Microsoft IDC Interview Experience | Set 150 (Off-Campus for Full Time)

I applied Off campus through Microsoft referral program. Initially the shortlisting was done on the basis of CV.

Round 1:

First round was Online coding round on co-cubes platform. There were 3 Questions to be done in 75 minutes. The questions were:

1. Given an array of integers of size n. Assume zero as invalid number and all other as valid number. Convert the array in such a way that if next valid number is same as current number, double its value and replace the next number with 0. After the modification, rearrange the array such that all 0’s are shifted to the end. [2 marks]
   Eg: [2, 2, 0, 4, 0, 8]
   => [4, 4, 8, 0, 0, 0]   
2. Given an array arr[], find the maximum j – i such that arr[ j ] > arr[ i ] [3 marks]
3. Write a function that accepts root of binary tree as its argument and return the sum of all leaf nodes that are at minimum level (i.e closest to leaf node).   [5 marks]

Students shortlisted were called Hyderabad for interviews.

Round 2: (Group Fly round)

1. Given a sequence of words and a limit n (max number of characters on a single line), You need to put the break or end that line such that limit n is not exceeded and also the complete word comes in single line i.e a word does not split into two lines.

   Example: 
   Its flagship hardware product are the Xbox video game etc. n=16

   Output:

   Its flagship
   hardware product
   are the Xbox
   video game etc.

15 Out of 44 were shortlisted for the next rounds.

Round 3: (Technical F2F)

1. The interviewer asked me to introduce myself and my areas of interest in Technologies. I said Machine Learning, then we had a discussion on Machine Learning algorithms.
2. Merge Sort for linked list and array.
3. Reverse a linked list. Both iterative and recursive approach. Comparison between them.
4. Questions regarding my internship experience.
5. Aptitude Question: You are blindfolded and 10 coins are place in front of you on table. You are allowed to touch the coins, but can’t tell which way up they are by feel. You are told that there are 5 coins head up, and 5 coins tails up but not which ones are which. How do you make two piles of coins each with the same number of heads up? You can flip the coins any number of times.
6. Discussion on my Minor Project.

9 Out of 15 were shortlisted for the next rounds.

Round 4: (Technical F2F)

1. Stock Buy Sell to Maximize Profit.
2. Sum of given range using segment tree.
3. How to perform the testing of code. Write all the test cases including the boundary ones for the above two codes.
4. OOPS concept:
   i)Encapsulation
   ii)Overriding and Overloading example
   iii)Real life implementation of abstraction and inheritance.
5. Aptitude Question: 100 people in room with a bulb on the ceiling. A person can see the rest 99 people but not himself. Some people have stickers on their face. Person himself can check the rest 99 people but does not know if he has sticker on his face. Light bulb turns on and off after fixed interval of time. If a person gets to know that he has sticker on his face, he has to move out of the room. At some point of time person comes to know if he has sticker on his face or not. How?
   Finally, he was satisfied with my answers and asked me if I had any questions. I asked him some questions about role and the work Microsoft offers.

7 Out of 9 were shortlisted for the next rounds.

Round 5: (Technical + HR)

1. Discussion on Minor Project and work done at JP Morgan during my internship.
2. Tower Of Hanoi Problem.
3. System Diagram of my minor Project and its use cases.
4. Why Microsoft? Why should we hire you?
5. One Change Microsoft can do on one of its products.
6. Why did you opt for Computer Science? Other Basic HR questions. Finally the interview was over. All the candidates were selected and were offered Full Time offer.

Suggestion: Don’t be tensed if you didn’t get an answer. Keep thinking and asking questions and try to interact with your interviewer. Don’t walk off immediately, ask some questions in return. They will give you hints if you are struck.

All Practice Problems for Microsoft !