Candidatei-me por meio de uma faculdade ou universidade. O processo levou 1 dia. Fui entrevistado pela Microsoft (Hyderābād) em out. de 2017
Entrevista
First there was online coding round in college conducted by Cocubes. Then one written coding round at Microsoft campus where we were asked to write code for 2 questions on paper using any language and 2 face to face Interviews followed by HR round.
Perguntas de entrevista [1]
Pergunta 1
Find Missing number from an array of numbers 1 to N. General C language conceptual questions like strings, QuickSort, MergeSort and their applications.
Second Interview round was on only one question which is level order traversal of n-ary tree without any Queue or Stack.
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,
