Envié una solicitud electrónica. El proceso duró 4 semanas. Acudí a una entrevista en Microsoft (Seattle, WA) en feb 2022
Entrevista
There is no tech question in the first Phone Interview.
The interviewer is a recruiter, so I think she doesn't know much about the software. And she was asking me while typing something on the board, I think she is writing something about me on their system.
Preguntas de entrevista [1]
Pregunta 1
1. Why do you start programming?
2. Tell me about the two projects you're impressed with. What kind of problem and how to solve it?
3. If you encounter problems with others in the teamwork, How to solve them?
4. The two languages you are best at, why?
5. Have you learned Algorithm, Data Structure, or OS courses before?
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.
