J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 2 jours. J'ai passé un entretien chez Microsoft (Gurgaon, Haryana) en août 2023
Entretien
Round 1(Technical Interview): This round went about for nearly 45 minutes and it was quite smooth. The interviewer was quite friendly and asked me one coding question and told me to explain my approach. The question was Maximum Sum Paths and I explained a brute force solution first and we had a 30-minute discussion about other approaches. Finally, he gave me a hint and told me to code my approach. Round 2(Technical Interview): The next round went on for about 1 hour and was again, mostly a coding round. The interviewer asked me 3 questions and I had to present my screen and run the programs for him. Round 3(Technical + HR): The interviewer asked for a small introduction and then started with my resume and asked me how much I know about current trends in the technical market.
Questions d'entretien [1]
Question 1
The questions were quite easy but one couldn’t resubmit their answers after the first submission, so we had to check out all corner cases before submitting. 2 frogs can start on any index in the given input array. The function should return the maximum possible distance these frogs can create between them (difference between the index values of both) by having them jump farther away from each other. Frogs can only jump on higher-valued elements or some of the same height and they can not skip any elements. The full question in detail is given here. A string consisting of characters ‘a’ and ‘b’ can be broken down into blocks of similar consecutive letters. Determine the minimum number of characters to be added to make all blocks of equal length.
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. J'ai passé un entretien chez Microsoft (Bengaluru)
Entretien
OA was taken, it was easy-medium consisting of a string problem and a DP problem. Technical Interview 1 was taken where they asked tree traversals using iteration and construction of trees using traversal
Questions d'entretien [1]
Question 1
Space Complexity of Traversal, also explain Morris Traversal
The entire process only had two rounds and it was really simple. Each round was around 45 minutes to an hour with a current Microsoft engineer and they just ask you a typical leetcode style question. There was also a behavioral round that was really simple.
Questions d'entretien [1]
Question 1
The first round was a typically leetcode question that was really easy. The second round was a little bit harder. It was about having a nxn square made out of 0s and 1s and it wants you to compute what the square looks like if it was rotated.
J'ai postulé en ligne. J'ai passé un entretien chez Microsoft (Belgrade) en avr. 2026
Entretien
It was a really enjoyable experience overall. Although I didn’t get the position, the interview itself was great, and I truly appreciated the opportunity to learn more about the role, the team, and the company.