4 technical rounds and no HR round, Very easy questions at campus related to linked list and tree, and from project.
Given a Heap find Nth largest node. you have access to left and right node.
Interview questions [1]
Question 1
There were few good questions related to linked list.
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.
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.
I applied through an employee referral. I interviewed at Microsoft (Bangalore Rural) in Jun 2026
Interview
The interview was hard, even as a fresher the dsa they asked was hard category after I checked on leetcode. Though I couldn't solve it. Some of the other people who interviewed were asked easy - medium dsa
