I applied online. The process took 3 months. I interviewed at Microsoft (Cairo, Cairo Governorate) in May 2020
Interview
Interview was several stages, first it was an hour long online text of some mcqs and 2 peoblems to solve, then i passed a certain score so was proceeded to do 2 interviews with 2 junior software engineers. First interview was good, second one I was actually fasting and tired since it was ramadan so I did really badly, what surprised me was that the interviewer mocked me and told me you seem to know nothing about this topic (was hash tables)
Interview questions [1]
Question 1
Cannot remember much but one question was about how to know if a string was a rotation of another
Another was how to make a copy of a linked list where a node that we dont know points to 2 nodes, the one after and one before
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.
