Solicité el puesto a través de la escuela superior o la universidad. Acudí a una entrevista en Microsoft (Montreal, QC)
Entrevista
I have submitted my resume at career fair when Microsoft team came for recruitment. After that I got a call for first round of interview on-campus. On the day of an interview, they asked me question from my resume, my past work and my interest. They provided me problems based on data structure and algorithm. I cleared 1st round of interview and now waiting for further rounds.
Preguntas de entrevista [1]
Pregunta 1
Question from my resume and Data Structure and algorithms.
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,
