Envié una solicitud electrónica. El proceso duró 1 día. Acudí a una entrevista en Microsoft (Bryanston) en oct 2016
Entrevista
they are very friendly..when i got in there they took me to the conference room, where i was being interviewed...they offered me water cos it was a very hot/sunny day and my interview was at 10:00
Preguntas de entrevista [1]
Pregunta 1
1.tell me about you self
2.what do you know about the department we are interviewing you for....
3.what can you say about cloud?
4.why would you want to work for Microsoft?
tha at the end of their questions they give you a chance to ask questions!!!
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,
