Ho presentato la mia candidatura online. La procedura ha richiesto 4 settimane. Ho sostenuto un colloquio presso Microsoft (Belgrade) nel mese di apr 2018
Colloquio
The first part of the hiring process was a written test composed of 4 algorithm based questions. One week later you will receive an email informing you have passed to the second stage. The second stage consisted of 3 back to back 50 minute interviews with 10 minute breaks in between, all of which were with a different interviewer. Each interview consisted of soft skill questions at the beginning as well as a technical question.
Domande di colloquio [3]
Domanda 1
Given a binary three write a function that will print out its nodes in a zig-zag order starting from the top e.g. print the head node, then the second level from left to right, the third from right to left etc.
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)
