J'ai postulé via un recruteur. Le processus a pris 5 semaines. J'ai passé un entretien chez Microsoft (Sydney) en sept. 2025
Entretien
It was very streamlined, the interview process itself was understandable and the interviewers were very nice and encouraging. I had to do two interviews with a one hour break in between, but it sapped my energy at the end.
P.S. writing this 2 days after the interview so I don't know the interview result yet... pray for me.
Questions d'entretien [1]
Question 1
Tell me about a situation where you helped with debugging something in frontend and/or backend and how the bug "propagated" and your process to debug that.
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.