Solicité el puesto a través de un captador. El proceso duró 2 meses. Acudí a una entrevista en Microsoft (Redmond, WA) en oct 2018
Entrevista
Received a DM on LinkedIn from a Microsoft recruiter, saying that she was impressed with my profile and asked me to apply to Microsoft's SWE/PM internship. I applied and messaged her back telling her I applied online. Got an on campus interview request 4 days letter.
On campus interview was 15 minutes behavioral followed by 15 minute technical coding question. Got the onsite interview 10 days later, scheduled it 3 weeks from the call day (to give myself time to prep). Went onsite to Redmond, interviewed four rounds for Azure/Windows, and got the offer 9 days later.
Preguntas de entrevista [1]
Pregunta 1
2 string/array questions, 1 hashmap question, 1 system design question, 1 sorting question, 1 expression tree question, 1 trie question.
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.
