Solicité el puesto a través de la escuela superior o la universidad. Acudí a una entrevista en Microsoft (Redmond, WA) en sept 2019
Entrevista
One round of university interview with an engineer. Got an unseen coding problem but I think it's LC easy or intermediate level.
Then one round of on-site, with one manager and one engineer. Both had a technical question at LC intermediate level, but the manager also spent half of the time with behavioral questions. Had some time to chat about industry life and technologies in the end.
Each round is about 50 minutes.
Preguntas de entrevista [1]
Pregunta 1
Merging two sorted lists in place (one of the lists has reserved space for all elements).
Finding the longest palindrome (standard version).
A binary manipulation 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
