Me postulé a través de otra fuente. El proceso tomó 2 meses. Acudí a una entrevista en Microsoft (Tel Aviv) en abr 2025
Entrevista
1 day with 3 interviews
Each with a different person from the team.
Needed to talk about myself and introduce myself to each person as they do not talk with each other between interviews about the interviewee, which i appreciate.
Overall nice experience, very nice people
Leetcode easy-midium questions.
Preguntas de entrevista [1]
Pregunta 1
Design a data structure that in O(1) updates every element to a desired value.
With O(1) add, and O(1) get.
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
Me postulé a través de un reclutador. Acudí a una entrevista en Microsoft (Tel Aviv)
Entrevista
hr reached to me on linkedIn and sent me Take-home assignment hosted on HackerRank. I had about 10 days to complete. The test included 1 medium/easy question and one hard question with style of LeetCode 3162 and 2080 (Range Frequency Queries)
Preguntas de entrevista [1]
Pregunta 1
hard question with style of LeetCode 3162 and 2080 (Range Frequency Queries)
