J'ai postulé via la recommandation d'un employé. Le processus a pris 3 semaines. J'ai passé un entretien chez Microsoft (Raleigh, NC) en oct. 2017
Entretien
First I had a one hour technical phone screen, they only asked one technical question (linked list related) . Later I was invited for an on-site interviews at Microsoft RTP office. Scheduling of the interviews was pretty confusing because they kept sending me general messages that related more to Redmond interviews.
I had total of 4 interviews each lasted for about 45-min. The problems were easy (I expected worse), I would recommend brushing up on basic data structures (hashmap, hashset, linked lists, etc) and knowing how and where to use Comparator. Lucky for me they didn't ask too many general behavioral questions, all were related to my resume.
They asked some questions I later found in CTCI book.
J'ai passé un entretien chez Microsoft (Tel Aviv-Yafo)
Entretien
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.
Questions d'entretien [1]
Question 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.
Questions d'entretien [1]
Question 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.
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. J'ai passé un entretien chez Microsoft (Haïfa) en juin 2026
Entretien
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.
Questions d'entretien [1]
Question 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.