I applied through other source. The process took 1 week. I interviewed at Microsoft (Nairobi) in Jan 2022
Interview
It was a short 30 min first-round interview where the questions were mostly based on getting to understand your technical capacity and your experiences. At the end you are given a question and given 5 mins to come up with a solution which you will explain to the interviewer.
The interviewer told me that at this phase they don't really look at the coding ability because that is something that can be taught while on the job but instead they usually look for interpersonal and problem-solving skills without forgetting teamwork of course. Overall it is not as hard as everyone on the internet makes it seem but it is best you be prepared.
Interview questions [1]
Question 1
What Microsoft product do you like and why?
What could you change about the Microsoft product and why?
Tell me how you would explain multi-threading to a non-technical person
What is one time you dealt with a difficult team mate and how did you navigate the situation?
What is the hardest project you've worked on so far?
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 (Haïfa) 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.
