Solicité el puesto a través de la escuela superior o la universidad. El proceso duró 1 día. Acudí a una entrevista en Microsoft (Herzliya) en jun 2019
Entrevista
Applied via University hi-tech fair along with.
~ 300 CVs made it to stage 1
~ 60 made it to stage 2
~ 30 made it to stage 3
~ 9 made it to stage 4 and signed the contract
1. Online test - 2 hours for 6 questions
2. Technical test - 3 hours of coding
3. Technical Interview - 1 hour
4. HR interview
Preguntas de entrevista [2]
Pregunta 1
Given a tree (not necessarily binary) as a list of tuples, where every tuple is (FATHER_KEY, CHILD_KEY) and keys are distinct - return a list of tuples for the same tree, without the given sub-tree of key X.
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.
Preguntas de entrevista [1]
Pregunta 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.
Preguntas de entrevista [1]
Pregunta 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.
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.
Preguntas de entrevista [1]
Pregunta 1
Find the lowest difference between two numbers in a list
