Applied at my university career fair. Got an on campus interview call in a week. The interviewer asked 2 technical coding questions and was not concerned with the syntax of the code. Focus more on logic and efficiency.
Questions d'entretien [1]
Question 1
Gave me a solution to a question and asked if its possible .
Solution was is it possible to find if two strings anagrams by doing xor operation between them ?
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.