Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto 2 mesi. Ho sostenuto un colloquio presso Microsoft (Singapore) nel mese di ott 2013
Colloquio
Everyone was very friendly. Was introduced to the culture at every break.
Domande di colloquio [1]
Domanda 1
Given the root of a tree where each node has a string but no parent pointer, output each level of the tree on a separate line. Tree may not be balanced. Expected runtime: O(n).
Ho presentato la mia candidatura tramite l'università. Ho sostenuto un colloquio presso Microsoft (Bengaluru)
Colloquio
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
Domande di colloquio [1]
Domanda 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.
Domande di colloquio [1]
Domanda 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.
Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso Microsoft (Belgrade) nel mese di apr 2026
Colloquio
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.