Candidatei-me online. O processo levou 3 semanas. Fui entrevistado pela Microsoft (Los Angeles, CA) em dez. de 2017
Entrevista
I applied to Microsoft University Program. The entire process took 2 weeks. I did one behavioral/technical interview via phone. I had problems with my connection since there was a fire in my area on the day of my interview. Therefore, I had to postpone it on the day of, yet they were pretty considerate about it. However, when I finally got the interview, spots were mostly filled.
Perguntas de entrevista [1]
Pergunta 1
What is one of new products of Microsoft are you interested in?
Fiz uma entrevista na empresa Microsoft (Tel Aviv-Yafo).
Entrevista
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.
Perguntas de entrevista [1]
Pergunta 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.
Perguntas de entrevista [1]
Pergunta 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.
Candidatei-me por meio de uma faculdade ou universidade. Fui entrevistado pela Microsoft (Haifa) em jun. de 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.
Perguntas de entrevista [1]
Pergunta 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.