I applied through university. The process took 1 day. I interviewed at Microsoft (New Delhi) in Aug 2017
Interview
It was a multi-round process.
Following were the rounds:
1. A written MCQ test on a platform, had some reasoning questions and some basic input-output questions
2. Coding round, a limited time coding contest, where we were supposed to solve questions and submit on an online judge. There were two problems and the overall time given to solve both of them was 30 mins.
3. Interview round 1, I was mostly asked about my profile and why I wanted to join Microsoft. One of my projects was also discussed. Then there was a coding question.
4. Interview round 2, I was asked a coding question. However, I just wrote some pseudo-code and the interviewer was happy with that.
Interview questions [1]
Question 1
One of the questions was about in place string compression. For example, given a string (or an array of characters) like 'abaabbbccc', how to compress it to a string 'a1b1a2b3c3' where the number written after the character indicates how many times the character occurred. Only a constant amount of extra space is allowed, the contents of the original array/string can be overwritten.
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.
