Me postulé a través de un reclutador. El proceso tomó 5 semanas. Acudí a una entrevista en Microsoft en ene 2015
Entrevista
A Microsoft recruiter contacted me, prompting me to apply for their internship program. I submitted my information, and I was contacted again within 2 weeks to set up a phone interview. The phone interview went great; the interviewer was upbeat and awesome. At the end of the interview, he told me I was great, and he thought I would fit in great at Microsoft, and that he looked forward to meeting me in person. Three weeks later, I received a generic rejection letter from a do not reply email address. The experience would have been perfectly fine if the interviewer did not state things he could not follow through with.
Stage 1: Take-Home Assessment – A 1-hour coding assignment consisting of two technical questions (one Easy and one Medium).
Stage 2: Virtual Interview Day – A Zoom-based interview day comprising three consecutive interviews.
Star method completely end to end with 3 interviews in the same day. It was online and then we were split into rooms. You mess up one and you mess up all
Maximum subarray questions+ oops + dbms. find the contiguous (connected) sequence of numbers within a 1D array that has the largest possible sum, a classic computer science problem solvable efficiently with Kadane's Algorithm (Dynamic Programming/Greedy) in O(N) time, handling positive, negative numbers, and returning just the sum. Variations exist, like finding the maximum product or handling 2D arrays,
Preguntas de entrevista [1]
Pregunta 1
find the contiguous (connected) sequence of numbers within a 1D array that has the largest possible sum, a classic computer science problem solvable efficiently with Kadane's Algorithm (Dynamic Programming/Greedy) in O(N) time, handling positive, negative numbers, and returning just the sum. Variations exist, like finding the maximum product or handling 2D arrays,