Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto 3 settimane. Ho sostenuto un colloquio presso Microsoft (Austin, TX) nel mese di ott 2017
Colloquio
I was invited for an interview on my college campus where I was interviewed by an engineer. I was offered an on campus interview, but couldn't fly out on any of the available dates.
Domande di colloquio [1]
Domanda 1
Traverse a tree in zig zag order; the first level is printed forwards, the second level is printed backwards, and so on.
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)
