Microsoft Visited our Campus as a part of Intern Selection and they conducted tests and interviews for the same.

Round 1: (Online Coding Round on Mettle) (2 hours)

The test consisted of 3 questions which were to be solved in 2 hours.

1: https://leetcode.com/problems/valid-parentheses/
2: https://leetcode.com/problems/word-break/
3: I dont remember the question but It was on Convex Hull.

I was able to solve 1.5 questions and was among 45 students selected for next round.

Round 2:(Group-Fly)(Pen and Paper)(1.5 hours)

It consisted of a group fly round which was pen and paper based.
Questions were projected on a screen and had to be solved on pen and paper.

1: https://leetcode.com/problems/largest-number/

2: You are given a matrix of dimension (n * m). A cell with a zero represents a
landmine. A cell with 1 is a normal cell. All cells adjacent to landmines ( top, bottom, left, right) are abnormal. You need to find the minimum length path between any cell in the first column and any cell in the last column. You can move to all adjacent cells (even diagonal ones) (normal cells) from a normal cell.

I was able to code both the questions within no time and was selected among 19 students for the next round.

Round 3: (Face to Face Interview)

The round consisted of a face to face interview with a senior microsoft engineer.

After Introduction part he jumped to questions

1: https://leetcode.com/problems/happy-number/

2: https://leetcode.com/problems/linked-list-cycle-ii/

3: He asked implementation of Simple Binary search.

Then he asked me about OOP's Concepts like virtual and types of polymorphism.

I was able to do all the questions with best complexity and the interviewer seemed very impressed.

Round 4:(Face to Face Interview)

The interviewer was professional one and straight away jumped to question.

1: https://leetcode.com/problems/merge-k-sorted-lists/

2: https://www.interviewbit.com/problems/check-if-given-preorder-inorder-and-postorder-traversals-are-of-same-tree/

3: https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/

I was able to answer first question and second question with some small hints from the interviewer.

On third questions I was able to only write recurrence relation and I could not complete the code given. The interviewer wanted a clean production ready code for the third question too.

Verdict: Reject