I applied online. The process took 2 months. I interviewed at Microsoft (New York, NY) in Mar 2022
Interview
Had an initial phone screen that was mostly behavioral (typical questions on background, resume, etc.) and one LC easy (detect if string is palindrome). Then two months later I had a final interview (2x45). First final was behavioral, resume and single LC medium (array) the second was behavioral and single LC easy (sort). Overall the interview process was great just a bit on the long side waiting for the recruiter to schedule final interviews.
Interview questions [1]
Question 1
Similar to (283. Move Zeroes) on LeetCode, except instead of moving zeros to the end of the array (which is pretty trivial), had to move zeros to beginning of the array while maintaining the order of all non-zero elements. Probably LC Easy/Med
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 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.