Me postulé en línea. El proceso tomó 2 semanas. Acudí a una entrevista en Microsoft en jun 2009
Entrevista
I was corresponding through emails and they confirmed a phone interview for the initial screening.
The interviewer was an HR lady.
I was basically asked about my projects, educational background some some questions about my availability and whether I was interested in doing some project management.
Preguntas de entrevista [1]
Pregunta 1
Be extreme thorough with the resume.Why did you choose a particular major and a project
HackerRank online assessment, followed by two back-to-back interviews. Each interview included a mix of behavioral questions and live coding problems. After the live coding portion, interviewer asked to analyze the time and space complexity of the solution.
Preguntas de entrevista [1]
Pregunta 1
Check if a given array represents a postorder traversal of a binary search tree
first there was an OA, which had 2 medium DSA questions, then in the first round of interview they asked me an anagram question which i couldnt answer. At the start, the interviewer also asked me questions on operating systems and networks
Me postulé a través de otra fuente. Acudí a una entrevista en Microsoft (Bengaluru) en nov 2024
Entrevista
First Round - Coding Test:
The first round was an online coding test with 3-4 problems. The questions focused on data structures and algorithms such as arrays, strings, and basic sorting. The environment was a standard online IDE, and I had to submit the code within the time limit.
2. Second Round - One-on-One Coding Interview:
This round was a live video interview with a Microsoft engineer. They gave me a coding problem on the spot, which involved solving a problem using arrays and hash maps. I was asked to explain my approach, write the code, and optimize it. The interviewer also asked follow-up questions to test my understanding.
Preguntas de entrevista [1]
Pregunta 1
Given a list of raindrop sizes (integers), find the total sum of all raindrops.
Given an array of positive integers where each element represents the maximum number of steps you can move forward from that position, determine if it is possible to reach the last index starting from the first index.