Me postulé a través de una facultad o universidad. El proceso tomó 3 meses. Acudí a una entrevista en Microsoft en mar 2017
Entrevista
Had an on campus interview in March 2017. Interview was 30 minutes long, consisted of about 10 minutes of behavioral questions/reviewing resume and about 15 minutes on one coding question. Took them almost 3 months to get back to me even after multiple requests on a status update from me.
Preguntas de entrevista [1]
Pregunta 1
Coding question was essentially to code a function to determine if a particular move had won the game of tic tac toe
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.