Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso Microsoft (Il Cairo, ) nel mese di apr 2022
Colloquio
Two interviews: First one(45 minutes): - Introduce yourself, about 3 easy machine learning questions, then 2 problem-solving questions, some questions about education and faculty courses Second: (45 minutes): 2 problem-solving questions
Domande di colloquio [1]
Domanda 1
-What are the differences between the training set, validation set, and test set? -Implement insertion in BST - Find the point of intersection of two linked lists - string compression problem - another problem-solving question from hacker rank - some questions about faculty courses - what team I want to join if I were accepted
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,
