Me postulé en línea. El proceso tomó 2 semanas. Acudí a una entrevista en Microsoft (Dublín, Dublín) en ago 2021
Entrevista
The first round interview was a 30 min virtual interview which was set up on Microsoft Teams. It had mostly behavioural questions such as: "What do you think makes a good programmer?" and "What are some of the Microsoft technologies that you use" (this would have a follow-up to ask for an improvement upon that technology if you name one). This interview would end with a brain teaser/problem that you are given 10-ish minutes to solve. They may not necessarily be looking for the right answer, but they do want you to think the process out loud. The interviewer did a great job at making me feel comfortable and confident!
Preguntas de entrevista [1]
Pregunta 1
Behavioural Questions followed by one brain teaser/problem which we are given about 10 minutes to solve.
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.