Me postulé en línea. Acudí a una entrevista en Microsoft en ene 2017
Entrevista
Quite a long process - after application you have to answer questions by means of a video recording of you speaking, then a Skype interview with recruiter, followed by calls from recruiters to organize assessment day, then assessment day consisting of 2 group activities and 2 interviews with managers... in my situation I did two more phone interviews before getting my placement.... 2 months of an interview process for a year long internship.
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,
