J'ai postulé en ligne. Le processus a pris 4 semaines. J'ai passé un entretien chez Microsoft (Belgrade) en nov. 2021
Entretien
After sending you information, after a couple of days you'll get Codility online test link, where you'll have to solve 4 problems within 3 hours. Usually, you don't have to solve all of them to go through. If you pass, you will then schedule three 45-50 min interview in a row, where you'll be again asked three different algorithmic problems, as well as going through you CV and talking about your preferences, experience, projects etc. Final offer should come within 2 to 3 weeks.
Questions d'entretien [1]
Question 1
In an array with multiple maximum values, return one index of the max value, where every correct index has an uniform probability of being chosen.
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.