J'ai postulé via un établissement d'enseignement supérieur ou universitaire. J'ai passé un entretien chez Microsoft (Redmond, WA) en sept. 2017
Entretien
Had a phone call for 30 minutes in March. Largely behavioral, but I was asked brain teasers at the end.
I was flown out in September to interview in Redmond. The experience was amazing, they really treated you well by paying for all necessary expenses and any sightseeing. On the day of the interview, I got to meet the other candidates in the morning and got lunch. Then we had 4 back to back rounds. These interviews were focused largely on Algorithms and thought process. I was asked 1 recursion/DP question, 1 graph question, 1 System Design, 2 Brain teasers, and 2 basic Data Structures questions overall. The interviewers did a good job at keeping you calm and focused during the interviews. It was a great experience overall!
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.