Ho presentato la mia candidatura online. La procedura ha richiesto 4 settimane. Ho sostenuto un colloquio presso Microsoft (Tel Aviv)
Colloquio
There are 2 professional interviews overall. It is usually starts with going over resume, 10 minutes or so about yourself and an interesting project you worked/working on.
After that they ask you a simple programming question which developes as you answer it correctly. The questions are almost all of the types that are in CTCI Book.
Domande di colloquio [2]
Domanda 1
Given a full binary tree, iterate over it from the top to the bottom while for each level of the tree iterate from left to right.
Given a full binary tree, iterate over it from the top to the bottom while for each level you change direction of iteration, for odd level go from left to right and for even go from right to left.
Ho sostenuto un colloquio presso Microsoft (Tel Aviv)
Colloquio
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.
Domande di colloquio [1]
Domanda 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.
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
