Solicité el puesto a través de la escuela superior o la universidad. El proceso duró 2 semanas. Acudí a una entrevista en Microsoft (Stoke-on-Trent, England) en ene 2022
Entrevista
It was good.
1. But the interviewer was having a bad internet connection which led to only an audio call on Teams. A video call would be better.
2. The interviewer asked me NOT to say out loud my thoughts while solving the given problem, contrary to which I read.
Preguntas de entrevista [1]
Pregunta 1
Q. Which year would you be graduating?
Q. What inspired you to apply at MS?
Q. Which application do you like from MS? And how would you improve it?
Q. Describe the most difficult project that you have done using your programming skills.
Q. Describe a difficult situation in your experience where you had to tackle a problem.
Q. How would you explain multi threading in layman terms. Use no technical terms.
Q. Problem solving question: (5 mins to solve):
There's a stone weighing 40 kg. You are given a scale where you can put the stone on one side and an item (whose weight is to be measured) on the other side. The weight of the item can be measured inclusive of 1 kg and 40 kg. If the stone is broken into 4 selected parts, then the weight can be measured. Is it true? If yes, what are the weights of the 4 parts of the stone?
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.
Solicité el puesto a través de la escuela superior o la 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.
