Candidatei-me por meio de uma faculdade ou universidade. O processo levou 4 semanas. Fui entrevistado pela Microsoft em fev. de 2015
Entrevista
I applied through my university.
I went through two different interviews, each 45 minutes long and really close together.
They both ask you the typical interview questions and they both focus on your resume.
Both interviewers were incredibly nice. They both try to push you in the right direction without giving away any answers or even partial solution. You need to seem genuinely interested, and for the most part, you actually will be! Don't be afraid to ask questions, don't be afraid to ask for input, but never expect a solution.
I won't post any of the technical questions they asked since it's a lot better to train yourself for the possibilities instead of specifics. In general, I got asked questions that were super easy to wrap your head around, but had many possible solutions which could be easy or hard, depending on the route you might of wanted to take.
Perguntas de entrevista [1]
Pergunta 1
Tell me about the project your were most proud of.
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,