Microsoft comes to our college every year to recruit students for 3 positions IDC (India Development Centre, Developer), IT (Tester) and SMSG (Sales & Marketing Services Group) IDC & IT Selection process First Round - Online test by aspiringminds.in 24 questions aptitude 24 C/C++ 24 Logical Thinking Shortlist appeared the same day -> 20 selected for IDC, 20 for IT, around 20 qualified both Second Round -> Coding IDC -> 3 questions -> 65 minutes String handling, matrix rotate 90 degrees, convert Doubly Linked List to Binary Tree Questions were simple and can be found in Cracking The Coding Interview (CTCI) book IT -> 4 questions -> 65 minutes first 2 were coding -> string reverse in place + one 1 more i dont remember How to detect if its a binary tree Test scenario of an airport Shortlist appeared after 2 weeks when microsoft came for Interviews I had 3 rounds of Technical Some had 1 round written + 3 rounds of Technical Round 1: Interviewer asked me about things written in my resume, what i did for Industrial training...just a brief description of what was done Common ancestor problem -> Solutions can be found in CTCI I knew the answer, so didnt have to think much... but i guess i struggled a bit to get to the final answer Round 2 You have n cities in a circle which have 1 gas station each which provide some amount of gas. You also have the distances between set of 2 consecutive cities. Assuming mileage 1 => 1 unit of petrol can cover 1 unit of distance i) Find if one can go through entire circle of cities with the given values of distances ii) If so, where should we start Code this & test this. [Answer: Consider 2 arrays G[] and D[]. i) if Sum of G[] >= Sum of D[] => circle possible ii) Find difference between both arrays' respective elements, and find a run that is always >=0 ] Round 3 Implement binary search on a sorted array that is shifted eg. 5 6 1 2 3 4 Again, answer can be found i CTCI