Ho sostenuto un colloquio presso Microsoft (Belgrade)
Colloquio
First, I sent my CV and cover letter. They contacted me and sent a link for a technical interview. I had two coding challenges of medium difficulty, and on the same day, they arranged a new interview. This interview consisted of three consecutive sessions, half in English and half in Serbian, each with coding questions.
Domande di colloquio [1]
Domanda 1
What project am I most proud of, outside of university projects
Ho sostenuto un colloquio presso Microsoft (Tel Aviv)
Colloquio
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
Ho sostenuto un colloquio presso Microsoft (Hyderabad)
Colloquio
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,
Domande di colloquio [1]
Domanda 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,
