Round 1 (Technical) : –
Interviewer first thoroughly went through my resume. He was impressed with my competitive coding profile, and then asked me to explain one of my project. He then asked me two algorithmic questions.
- Question 1 – Given a tree rooted at a certain node, find the maximum height, also print all the nodes on the path on maximum height. https://www.w3wiki.org/write-a-c-program-to-find-the-maximum-depth-or-height-of-a-tree/
I had to completely code it on paper from input to output, and then thoroughly explain the whole code. - Question 2 – Given a N X N matrix with positive, zero or negative elements, find the sub – matrix with largest sum. https://www.w3wiki.org/dynamic-programming-set-27-max-sum-rectangle-in-a-2d-matrix/
Even after lot of thinking, I was not able to provide the optimal O(n^3) solution, and offered him brute – force + preprocessing solution of O(n^4). He was not helping with hints. After sometime, he asked me to the code solution I got, and interrupted me and said it’s ok as I was halfway through writing the code.
The interview went for around one hour.
Microsoft IDC Interview Experience | Set 156 (Off-Campus for Full Time)
I applied to Microsoft through referral program for full – time position of software development engineer. All of the candidates who applied through referral were invited for an online coding test on co-cubes platform after 2-3 weeks.