Me postulé a través de una facultad o universidad. El proceso tomó 1 semana. Acudí a una entrevista en Microsoft
Entrevista
It took 30 minutes and the recruiter asked me to explain 1 project in my resume, and asked a question involving removing duplicates from an array. After I gave my answer he asked how to make it more efficient and the Big O notation for it.
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