Solicité el puesto a través de la escuela superior o la universidad. El proceso duró 4 semanas. Acudí a una entrevista en Microsoft (Singapur) en ene 2016
Entrevista
There was first a brief phone interview, followed by an online interview through their medium. Pretty predictable and regular questions such as "why do you want to work here" and "how do you think you can contribute et cetera. I thought the platform was cranky though - I had difficulties allowing access to microphone / camera and all, and I didn't hear back from them after that.
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,
