I applied online. The process took 5 months. I interviewed at Microsoft in Mar 2024
Interview
I applied in October, received and aced OA in November (2 LC medium DSA Q's). They scheduled me for an interview months later. I had two back to back interviews (45 minutes each) which consisted of one or two behavioral questions and a DSA questions (LC mediums, but on easier side). I answered the questions well and was able to solve all of the coding questions fairly easily and clearly.
Interview questions [1]
Question 1
Behavioral:
- Take me through the project you are most proud of.
- What was a time where you faced conflict within a group?
Technical:
- Merge intervals LC
- Find second largest element in an array in O(n), then adjust solution to find nth largest element in array
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.