J'ai postulé en ligne. Le processus a pris 3 semaines. J'ai passé un entretien chez Microsoft (Redmond, WA) en sept. 2018
Entretien
When Microsoft sends you an email saying you did well on your first-round interview, but unfortunately they do not have any spots left for the coming summer, don't take it as them just being polite! Microsoft actually reached out to me the next fall, offering a fast-track to a final, on-site interview because of my performance the year before. I was flown to WA, stayed in a nice hotel, and had a great experience throughout the 4-5 technical interviews given. They give you time to socialize with the other interview candidates as well, which helped lessen the stressful atmosphere. A few weeks later, I received the good news!
J'ai passé un entretien chez Microsoft (Tel Aviv-Yafo)
Entretien
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.
Questions d'entretien [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.
Questions d'entretien [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.
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. J'ai passé un entretien chez Microsoft (Haïfa) en juin 2026
Entretien
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.
Questions d'entretien [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.