J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 4 mois. J'ai passé un entretien chez Microsoft (Seattle, WA) en janv. 2016
Entretien
After doing an on-campus interview which lasted for 30 minutes, I got an invitation to attend an interview in Microsoft headquarters in Seattle. During the Seattle interview, there were 4 back-to-back interviews where the third one was a lunch interview and the last interview was with the manager of the team that I was assigned. 3 of the interviews asked data structure questions and one of them asked an object-oriented design question.
Questions d'entretien [1]
Question 1
For a given number, write an algorithm that can find its square root.
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.