Microsoft IDC Internship Interview Experience

Microsoft visited our campus  in the start of August for hiring interns for Microsoft IDC Bengaluru/Hyderabad.All students having cgpa > 7 were shortlisted for the first round.

Round 1: 

The first round was a coding round conducted on mettl.com  for 1.5 hrs.It consisted of 3 questions which were:-



  1. You are given n sticks with differing lengths.You can either increase the length of the stick or decrease it.An array of costs was also provided where the ith entry signified the cost for increasing or decreasing the length of the ith stick by 1 unit.You had to make all the sticks of equal length and ensure minimum cost was incurred while doing this.
  2. You were given 2 strings A and B.B was a sentence and we had to find all the words in B which had A as their prefix string.For eg: A = “San”  B=”Sandy Hook has lot of sand”.  Output will be “Sandy, Sand”
  3. 2 people A and B are fighting each other.They attack each other equal no.of times .B respects A and never performs and extra attack before A i.e. at all times no.of attacks by A are >= attacks by B.You were given a string where each character denoted the attack by A or B.You had to make minimum modifications to this string to make sure that above mentioned constraints are satisfied .For eg: Given “BBBB” we had to make two modifications and convert it to “ABAB”.

The IDE was unlike the one at gfg and hackerearth and prior practice on this ide would be very helpful .Everyone got different questions and they had different marking schemes so there was no definitive cutoff.60 students were shortlisted for the next round.

Round 2: 

This was a group flyer round for 1 hr in which we had to write code for 2 question :-

  1. Given a time in HH:MM format rearrange digits of the time to get the next closest time possible.You could use any of the digits any no.of times.For eg given “09:31” the output would be “09:33” .
  2. Find diameter of binary tree.This path might or might not pass through the root node.

The code should be written neatly(proper indentation, variable names) with comments in appropriate places . The time complexity should be mentioned and sample test case had to be written and run on the code.I was able to solve 1 question but followed all the rules above and was selected.20 students were shortlisted for the next round.

Round 3:

It was a technical interview where 2 questions were asked :-

  1. Given a string identify if its a valid IP address.You can find this question here .
  2. Given 2 positions in matrix find whether path exists between them.You can find this question here .

Round 4:

It was a technical interview where I was asked to implement a Sudoku-Solver and calculate time complexity of the Backtracking approach.In case of interviews, keep telling the interviewers your approach as you formulate your solution.Write code in a neat way and if you identify a mistake in your code then tell the interviewer and correct it.11 students were shortlisted for the next round including me.

Round 5:

This was a HR round in which questions were asked from the resumè.I had to explain all the projects that I did and asked him of the projects being done at Microsoft. The interview was very general with no technical questions asked.

Finally, 5 students were shortlisted for the internship on the basis of last 3 rounds.I was also selected.I would like to thank GFG for my success and would request aspirants to regularly do GFG practice in order to get internship at companies like Microsoft.

 

Write your Interview Experience or mail it to contribute@geeksforgeeks.org



My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.




Article Tags :
Practice Tags :


1


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.