Envié una solicitud electrónica. El proceso duró 2 meses. Acudí a una entrevista en Microsoft (Redmond, WA) en oct 2023
Entrevista
I had a OA then had two technical interviews. Cold application received update on being selected in about three weeks. Then got sent the OA and a invite to online preping group. Then after that got invited to another event similar online prepping group then interviews. Then received offere for internship.
Preguntas de entrevista [1]
Pregunta 1
Every combination on phone number, and palindrome, binary trees are equal, reverse link list.
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,
