Me postulé a través de una facultad o universidad. El proceso tomó 2 días. Acudí a una entrevista en Microsoft (Bengaluru) en jul 2019
Entrevista
1. Intersection of two linked list.
2. There is a 2 d array. 0 signifies water and 1 signifies land. an island is connected 0s(in all 8 direction) and no 0 should be on the outer edge of two array. You have to count the bumber of such possible array.
You have to solve both coding question to enter in 2nd round
In round 2 interviewer were very cool and supporting. try to shake hand while entering and ask every detail of problem.
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
