Ho presentato la mia candidatura tramite segnalazione di un dipendente. La procedura ha richiesto 6 settimane. Ho sostenuto un colloquio presso Microsoft (Monterrey, Nuevo León) nel mese di set 2018
Colloquio
It last 1 and a half month to finish the process. The process starts with your recruiter telling you about the next interview you will have. In my case I had 1 interview on site (locally). The recruiter tells you more about what will happen if you ace your next interview with them. In my case, I did not pass to the next interview. They asked me just one technical question, which I solved.
Domande di colloquio [1]
Domanda 1
What is the minimal number of coins you will need in order to reach a target. They give you the currency ex. [1,2,3,4,5,6] and the target ex. 28. you will need to return the number of minimal coins in order to reach the target.
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.
Domande di colloquio [1]
Domanda 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.
Ho sostenuto un colloquio presso Microsoft (Il Cairo, )
Colloquio
One HR interview, then two problem-solving interviews (beginer level) on HackerRank. You can choose the best programming language for you to use in solving problems. You should think out loud to enable your interviewer to understand how you would think to solve the problem.
Domande di colloquio [1]
Domanda 1
Find the lowest difference between two numbers in a list
Ho presentato la mia candidatura tramite un selezionatore. Ho sostenuto un colloquio presso Microsoft (Tel Aviv)
Colloquio
hr reached to me on linkedIn and sent me Take-home assignment hosted on HackerRank. I had about 10 days to complete. The test included 1 medium/easy question and one hard question with style of LeetCode 3162 and 2080 (Range Frequency Queries)
Domande di colloquio [1]
Domanda 1
hard question with style of LeetCode 3162 and 2080 (Range Frequency Queries)
