Me postulé en línea. Acudí a una entrevista en Microsoft (Redmond, WA) en oct 2020
Entrevista
Applied online no referral. First round was a phone interview. Was told to expect a mix of technical and behavioral questions. The interviewer was very pleasant and friendly. Was notified of final round invitation a week later.
Final round came around and the coldness of the interviewers caught me off guard. The first interviewer was late and did not introduce himself to me. He could not figure out how to share his codility link with me. I had to answer all of his questions verbally without sharing any screen. The second final round interviewer talked about himself and then my resume and questions about myself for the first 80% of what was supposed to be a technical interview. At the end he only allowed me around 5 minutes to work on the technical problem through codility. I verbally solved it and said what I would do if I had more time.
Preguntas de entrevista [1]
Pregunta 1
Why Microsoft?
Return the smallest integer in a circularly sorted array.
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.