I applied online. The process took 4 weeks. I interviewed at Microsoft (Redmond, WA) in Sep 2025
Interview
There are 2 back to back interviews both are 30 minutes long containing both technical and behavioral aspects, they will ask 2-3 questions about stuff like "Tell me about a time you had different point of view from a teammate and how did you over come that problem"(I do not remember the exact question but they are in the lines of this) then the technical part was a easy leetcode questions, but solving the question isn't the part they are looking for they are looking for the way you approach it so make sure at the begenning describe the problem in your own words and explain how would you approach it then run through an example yourself, and after all that start writing the code for it, and make sure to write test cases at the end to look for edge cases. I received my offer 2 weeks after my interview.
Interview questions [1]
Question 1
"Tell me about a time you had different point of view from a teammate and how did you over come that problem"(I do not remember the exact question but they are in the lines of this)
I applied through their website with a referral, after a month or so they sent me a home exam, I think about a month after that i had 3 interviews in the same day, each one around 1:15 hours.
Interview questions [1]
Question 1
implement a dictionary where you have set,get and setAll, all in O(1)
The hiring process consists of a HackerRank home exam, followed by three technical interviews covering LeetCode-style problems and system architecture. Once this is done, you will have a final HR interview.
Interview questions [1]
Question 1
I had a technical interview where I was asked to solve the classic 'Climbing Stairs' problem (LeetCode #70), which is a dynamic programming question based on the Fibonacci sequence.
I applied through college or university. I interviewed at Microsoft (Haifa) in Jun 2026
Interview
The process started with an online HackerRank assessment. The main coding question involved partitioning an array of server capacities into K contiguous groups while minimizing the maximum group sum. The solution required binary search on the answer combined with a greedy validation function. The assessment focused on algorithms, problem solving, and time complexity analysis.
Interview questions [1]
Question 1
Given an array representing server capacities and an integer K, divide the array into K contiguous groups such that the largest group sum is minimized. Return the minimum possible value of the maximum group sum.
