J'ai postulé via un établissement d'enseignement supérieur ou universitaire. J'ai passé un entretien chez Microsoft
Entretien
The overall process was long. Pictorially the process looks as below:
Online Round -> Group Fly Round -> Technical interview 1 -> Technical Interview 2 -> Technical Interview 3 -> HR Interview
Online round was conducted on CoCubes platform and had 3 questions. All were easy and could be done in the given time of 90 minutes.
Questions d'entretien [1]
Question 1
Given a row-wise and column-wise sorted matrix of 0s and 1s, find out the row with maximum 0s.
Given a sorted array, find if two numbers can be added upto a given sum k.
Print zig-zag level order traversal of the tree.
J'ai passé un entretien chez Microsoft (Tel Aviv-Yafo)
Entretien
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
J'ai passé un entretien chez Microsoft (Hyderâbâd)
Entretien
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,
Questions d'entretien [1]
Question 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,