Me postulé en línea. El proceso tomó 5 semanas. Acudí a una entrevista en Microsoft (Praga) en dic 2017
Entrevista
It might take some time until the recruiter decides to give you on site interview. For me my recruiter said that there are no free spots and I have to wait approximately one month for a response. So I had waited and got the onsite interview approx. 5 weeks after the phone screening.
The onsite interview consists of four 1:1 interviews. I believe you have to get "OK" grade on at least 3 of them to get the offer, but it probably depends on other candidates.
In my case 2 of them were algorithmic, 1 algorithmic but without writing any code and one more about OOP.
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.
Preguntas de entrevista [1]
Pregunta 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.
Preguntas de entrevista [1]
Pregunta 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.
Me postulé a través de una facultad o universidad. Acudí a una entrevista en Microsoft (Haifa) en jun 2026
Entrevista
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.
Preguntas de entrevista [1]
Pregunta 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.
