Candidatei-me por indicação de um funcionário. O processo levou 2 semanas. Fui entrevistado pela Microsoft (Tel Aviv-Yafo) em abr. de 2020
Entrevista
So it is a total of 4 interviews first one being HR online on skype which is typical hr questions plus a little puzzle (in English doesnt matter if you are going to work at the company hq which isnt in English speaking country) and then other 2 professional interviews usually 2 on 1 and ends with another HR
Perguntas de entrevista [1]
Pergunta 1
The puzzle they asked me for instance was a fairly simply one the typical apple puzzle :
You have nine apples of the same size. Nine of them weight the same, and one of them weighs slightly more or less. How can you find the apple that is different by using a balance and only two weightings?
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.
