Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso Microsoft (San José, ) nel mese di nov 2024
Colloquio
Consta de unas 3 o 4 etapas de pruebas técnicas de alrededor de 45m todas el mismo dia, con dificultades medias y trae bastante pensamiento en algoritmos, también en estructura de datos
Altre recensioni di colloqui per Internship presso Microsoft
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,
