Developer applicants have rated the interview process at Microsoft with 4 out of 5 (where 5 is the highest level of difficulty) and assessed their interview experience as 50% positive. To compare, the company-average is 68.2% positive. This is according to Glassdoor user ratings.
Here are the most commonly searched roles for interview reports -
I interviewed at Microsoft (Bucarest, ) in Mar 2024
Interview
First was an online test with three easy problems. The first one was to find a bug in a function(it was to change an and condition to an or condition or something like this), the second one to convert a string of binary digits to an int and the third one was a very easy greedy algorithm.
After that, there were three interviews one after the other. The first one was started with behavioral questions then a technical problem(not really algorithm), then system design, then to implement a concurrent hash map(also had to implement the linked list). Code didn't need to run, but it needed to be clear. The system design was the bad one for me. I couldn't understand what the interviewer said, he didn't seem to understand my questions(I had to implement a system that sells vehicles and I asked how many vehicles are expected to be sold and he said all of them) and he gave no feedback if I was on the right track or not. He talked very little while I did the design.
Interview questions [1]
Question 1
Design a system that sells vehicles, which also are in a showroom. The users can make a reservation to test one of the vehicles.
Three interviews in a row. Before that, codility challenge. Behavioral questions in between coding exercises. Coding can be about trees, graphs, linked lists, know about eviction policies and how cache works
I applied through an employee referral. The process took 2 weeks. I interviewed at Microsoft (Barcelona) in Mar 2024
Interview
Una serie (3) de entrevistas que duraron toda la tarde. En cada una te preguntaban un poco sobre ti y luego te hacían una serie de preguntas de programación. Aún superar la mayoría de ellas con complejidades óptimas, la segunda entrevista se complicó. El problema no se definió bien ni fue bien explicado. Se hizo de todo menos colaborar para ello. Llegó un punto en el que empecé a programar una solución, pero se me cambió la estructura de datos que estaba usando por la "default" que se habría dado por buena, sin tan solo darme opción a usar mi método.
Interview questions [3]
Question 1
Calcula todas las posibles combinaciones de paréntesis viables (es decir, "()()" es viable pero "()())(" no lo es), hasta n=8 (n=pares de paréntesis).
Haz un JOIN entre dos listas de tal manera que se devuelvan los pares iguales entre listas (ejemplo, [1,2,3] y [1,2,2] devuelve [1,1], [2,2] y [2,2]).
Luego haz lo mismo, pero las listas son "streams" de números (no caben en memoria y van pasando uno a uno) y los diccionarios tampoco caben en memoria.