Developer applicants have rated the interview process at Microsoft with 3.4 out of 5 (where 5 is the highest level of difficulty) and assessed their interview experience as 63% positive. To compare, the company-average is 67.6% positive. This is according to Glassdoor user ratings.
Candidates applying for Developer roles take an average of 60 days to get hired, when considering 8 user submitted interviews for this role. To compare, the hiring process at Microsoft overall takes an average of 30 days.
Common stages of the interview process at Microsoft as a Developer according to 8 Glassdoor interviews include:
Skills test: 38%
Phone interview: 38%
Personality test: 13%
Presentation: 13%
Here are the most commonly searched roles for interview reports -
2 medium lc questions - 2d dp (which i think is hard) and another string question, all available on lc.
2 interviews in a row and another on another day. i think im happy that i didn't get the role at the end because it wasnt as good as i thought.
it was easier than expected. had 3 rounds loop. each round had 1 dsa and 1 round had dsa plus lld. leetcode easy to medium questions. basic behavioral questions. found the interviewers interesting.
I applied online. I interviewed at Microsoft (Tel Aviv) in Mar 2026
Interview
First you have to complete a home assignment of two Leetcode questions in 90 minutes (can't remember them, but medium difficulty) .
After that, you're invited for an interview day (virtual, over Microsoft Teams)
In the first interview I was introduced to the team leader, the role I was going to be assigned to, and we talked about my previous experience and education, showcasing a project I was taking part in, and then we went on to do a simple Leetcode question.
The second interview was straight up two Leetcode questions and that's it.
All the interviewers were friendly, professional and made me feel like they wanted me to succeed, great experience overall.
Got a call one day later telling me I got accepted.
Interview questions [5]
Question 1
Introduce yourself, showcase a project you took part in.
What were the challenges? Which parts were you responsible for? and other project specific questions
You're given an NxM matrix consisting of '*' and '.' values. Return a new matrix of size NxM, such that each '.' is replaced with the number of its neighbors that are equal to '*' (minesweeper problem but easier)
Implement a FastArray:
Init(n): initializes the FastArray to be of size n
Set(i, v): Set the value at index "i" to the new value "v"
Get(i): Get the value at index "i"
SetAll(v): Set all the values to "v" (calling the Set method overrides this for the specific index it was called on)
All operations should be at O(1) time complexity
Implement a BST Iterator:
init(root): Initialize the BST Iterator with the root of the tree (TreeNode)
getNext(): Return the smallest value (which wasn't returned so far)
hasNext(): Return True if there are values you haven't returned yet, False otherwise