J'ai postulé via la recommandation d'un employé. J'ai passé un entretien chez Microsoft en sept. 2022
Entretien
i applied through a person who works there and therefore got a quick response. first round was online coding skills test. it consisted of 2 tasks and time limit of 75 minutes. first task: given a string you must split into a minimal number of substrings in such a way that no letter occurs more than once in each substring. second task : 2 frogs that want to jump away and u need to return the longest distance
Questions d'entretien [1]
Question 1
was asked about certain courses what's the difference between array and list i was asked to explain the term "multi-threading"
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.