Solicité el puesto a través de la recomendación de un empleado. El proceso duró 4 semanas. Acudí a una entrevista en Microsoft (Tel Aviv) en sept 2022
Entrevista
I had an HR interview and 2 other technical interviewers. the first one went great, however, the second one did not. I didn't like the fact that I didn't get feedback! I was informed that I'm not getting an offer but no further details were provided.
Preguntas de entrevista [1]
Pregunta 1
1) Implement an iterator for a binary tree 2) Given 2 strings s1 and s2, return True if s2 is a substring of s1. Follow up: Return True if any combination of s2 is a substring of s1
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
