J'ai postulé via une autre source. Le processus a pris 6 jours. J'ai passé un entretien chez Microsoft (Hyderâbâd) en mai 2025
Entretien
A big benefit with using linked lists is that nodes are stored wherever there is free space in memory, the nodes do not have to be stored contiguously right after each other like elements are stored in arrays. Another nice thing with linked lists is that when adding or removing nodes, the rest of the nodes in the list do not have to be shifted.
Questions d'entretien [1]
Question 1
A big benefit with using linked lists is that nodes are stored wherever there is free space in memory, the nodes do not have to be stored contiguously right after each other like elements are stored in arrays. Another nice thing with linked lists is that when adding or removing nodes, the rest of the nodes in the list do not have to be shifted.
J'ai postulé en ligne. J'ai passé un entretien chez Microsoft (Melbourne)
Entretien
After submitting an online application, I received a HackerRank assessment after passing the resume screening stage, then I was rejected after completing the assessment and did not proceed to further interview rounds.
Questions d'entretien [1]
Question 1
The assessment consisted of two LeetCode-medium-level coding questions to be completed within 75 minutes.
J'ai passé un entretien chez Microsoft (San Francisco, CA)
Entretien
45 mins technical interview with a member of their San fran team. Very relaxed and informal but questions were focused and lots of follow ups. Easy to schedule as was over video conferencing platform
J'ai passé un entretien chez Microsoft (Seattle, WA)
Entretien
Straightforward technical loop overall, with strong interviewers at every stage. I genuinely enjoyed the in-depth conversations around technical challenges and algorithmic problem-solving — the entire process felt well-structured and genuinely engaging.