I applied online. The process took 1 week. I interviewed at Microsoft (Redmond, WA) in Aug 2025
Interview
Asked about past experience and resume. Questioned on my experience on large-scale distributed system and thought it's not "large" enough. Other questions are normal BQ.
Came to the coding part at half-way for a 45-min tech screen. I have a bad feeling when he said coding as the remaining time is not long. The coding question is, given a valid BST, a target value and a target distance k, find all nodes having a distance k with the node having the target value in the BST, both parent and child nodes count, disregard for output order. I spent the rest of time but didn't work this out.
After looking up afterwards this seems to be a mid-to-hard lc problem. I don't think 20 min would be enough to come up with the correct solution and code for anyone who's not lc pro..
Interview questions [1]
Question 1
Asked my experience on large-scale distributed system as they are from Azure.
I applied online. I interviewed at Microsoft (Melbourne)
Interview
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.
Interview questions [1]
Question 1
The assessment consisted of two LeetCode-medium-level coding questions to be completed within 75 minutes.
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
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.