J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 3 semaines. J'ai passé un entretien chez Microsoft (Redmond, WA) en sept. 2019
Entretien
Microsoft was very friendly. A recruiter reached out to me on LinkedIn to schedule an on campus interview at my college. That interview was not too bad. Was asked a question on how to manipulate a matrix. 4 hours after my interview they sent me instructions on how to schedule my next one in Seattle. At Seattle they were very friendly again. They are trying a new interview process where they only do 2 interviews compared to the 4 they were used to. Both interviews were 45 minutes long with 30 of those minutes being a technical question and the rest is you asking questions.
Questions d'entretien [3]
Question 1
Given an int matrix, every zero found, zero out the column and row.
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.