Me postulé a través de un reclutador. Acudí a una entrevista en Microsoft (Monterrey, Nuevo León) en oct 2022
Entrevista
I interviewed in 2 stages, both technical. First a lighter question at my uni (they were doing a recruitment event) and the second was in a different city. I mentioned that I had to go by plane because it was far from me and they paid for both the plane and the accommodations. The first round was standard, just the technical question and I got asked to rank my interests. On the second round there were 4 sessions with 4 different interviewers. First asked a behavioral question and a tech question, second tech and desing, third two tech questions, fourth only one tech question but I think I was meant to go back and forth more as I got a "if you had asked me I would not have allowed X but I love that you did it" (I think I added some error checking that was not necessary, it was a long time ago)
Preguntas de entrevista [1]
Pregunta 1
How do you check that a number is a palindrome without converting it to a string.
A leetcode style test with three problems, then three interviews with different managers ( for each it was a coding problem and behavioral questions). Each interview was 1 hour long
Preguntas de entrevista [1]
Pregunta 1
How do I react and handle a conflict situation at work
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.