Walking into the technical round, I had an unexpected moment of déjà vu when I was asked to find the lowest common ancestor in a binary tree. It was just like the question I had practiced on prachub.com a few days earlier. The interview also included designing an LRU cache and reversing a linked list, which I felt comfortable with too. Overall, the process was smooth, starting with a recruiter screen and a couple of phone interviews. I received an offer, but ultimately decided to decline.
Interview questions [3]
Question 1
Given a binary tree, find the lowest common ancestor of two given nodes
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.