Solicité el puesto a través de la recomendación de un empleado. El proceso duró 2 meses. Acudí a una entrevista en Microsoft
Entrevista
Took an online assesment and got an hr interview afterwards, did not pass the hr interview. online coding assesment was rather easy and was repetetive from what my friends got for the same interview.
Preguntas de entrevista [1]
Pregunta 1
You are given a 0-indexed integer array stones sorted in strictly increasing order representing the positions of stones in a river.
A frog, initially on the first stone, wants to travel to the last stone and then return to the first stone. However, it can jump to any stone at most once.
The length of a jump is the absolute difference between the position of the stone the frog is currently on and the position of the stone to which the frog jumps.
More formally, if the frog is at stones[i] and is jumping to stones[j], the length of the jump is |stones[i] - stones[j]|.
The cost of a path is the maximum length of a jump among all jumps in the path.
Return the minimum cost of a path for the frog.
Envié una solicitud electrónica. Acudí a una entrevista en Microsoft (Melbourne)
Entrevista
After submitting an online application, I received a HackerRank assessment after passing the resume screening stage, then I was rejected after completing the assessment and did not proceed to further interview rounds.
Preguntas de entrevista [1]
Pregunta 1
The assessment consisted of two LeetCode-medium-level coding questions to be completed within 75 minutes.
Acudí a una entrevista en Microsoft (San Francisco, CA)
Entrevista
45 mins technical interview with a member of their San fran team. Very relaxed and informal but questions were focused and lots of follow ups. Easy to schedule as was over video conferencing platform
Straightforward technical loop overall, with strong interviewers at every stage. I genuinely enjoyed the in-depth conversations around technical challenges and algorithmic problem-solving — the entire process felt well-structured and genuinely engaging.