Ho presentato la mia candidatura tramite un selezionatore. La procedura ha richiesto 6 settimane. Ho sostenuto un colloquio presso Microsoft nel mese di ott 2018
Colloquio
Got contacted for an on-campus interview, but completely failed the interview. Heard back ~3 weeks afterwards. Failed the coding question which was probably just a Leetcode medium. Some of my friends got questions that are Leetcode easy. If I were to do this again I would make sure to get a lot of sleep and not to be nervous (to the point that I'd blank out again):(.
Domande di colloquio [1]
Domanda 1
Talk about one time you worked a hard problem in a group and how you came about debugging it.
Ho sostenuto un colloquio presso Microsoft (Tel Aviv)
Colloquio
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.
Domande di colloquio [1]
Domanda 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.
Domande di colloquio [1]
Domanda 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.
Ho presentato la mia candidatura tramite l'università. Ho sostenuto un colloquio presso Microsoft (Haifa) nel mese di giu 2026
Colloquio
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.
Domande di colloquio [1]
Domanda 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.
