Candidatei-me por meio de recrutador(a). O processo levou 4 semanas. Fui entrevistado pela Microsoft (Seattle, WA) em mar. de 2016
Entrevista
Got contacted by a recruiter through Linkedin. Applied through Microsoft webpage and also sent my cv to the recruiter (it was requested by him). Got a phone interview about 2 weeks later, they did not ask any personal questions, only about my previous experience and projects. Seemed to be really interested in my bachelor project, she made a lot of questions about it. Then a brain teaser which I failed, she did not seem to care too much, just explained the answer to me. Then she allowed me to ask her questions and she answered them in detail. Really nice, pleasant interview. She told me they will contact me in 3 weeks.
Fiz uma entrevista na empresa Microsoft (Tel Aviv-Yafo).
Entrevista
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
Fiz uma entrevista na empresa Microsoft (Hyderābād).
Entrevista
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,
Perguntas de entrevista [1]
Pergunta 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,
