Solicité el puesto a través de la escuela superior o la universidad. El proceso duró 2 meses. Acudí a una entrevista en Microsoft (Redmond, WA) en nov 2018
Entrevista
Had an on campus interview in September 2018 and onsite in November 2018, 5 rounds in On-site. Covered Data Structures and Algorithms questions (leetcode medium mostly). Was expecting to get the offer but in the end it is the HR's call and didn't receive the offer. Be sure you are enthusiastic throughout the day as my interviews lasted from 9 am - 5pm with lunch interview as well.
Preguntas de entrevista [1]
Pregunta 1
Typical questions on CTCI and Leetcode - arrays, string manipulation, binary trees, etc.
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.