J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 3 semaines. J'ai passé un entretien chez Microsoft (La Jolla, CA) en févr. 2013
Entretien
Talked to recruiters at a job fair. Got an email three days later for an on campus interview. Responded and signed up for an interview slot on their website. Interview was about 25 mins, starting off with a couple behavioral questions and questions about my resume. Ended with a short technical question, which the interviewer asked me to test afterwards.
Questions d'entretien [1]
Question 1
Given an array of characters, compress the array in a way such that [aBBBAAaaa] becomes
[a1B3A2a3].
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.