Ho presentato la mia candidatura online. La procedura ha richiesto un giorno. Ho sostenuto un colloquio presso Microsoft nel mese di ott 2019
Colloquio
It was a virtual interview process for 30 min. Asked questions from algorithms, OS and DBMS. the interview is held after the coding round which consisted of 3 questions. Questions from linked lists and merge sort were also asked.
Domande di colloquio [1]
Domanda 1
In interview the question was asked about detecting a loop in the linked list. Also questions were asked from data structures
Ho presentato la mia candidatura online. La procedura ha richiesto 2 settimane. Ho sostenuto un colloquio presso Microsoft
Colloquio
The interviews were 2 times after each other, each 45 min with a 15 min break in between, the questions were problem-solving code, one was from LeetCode. Also keeps changing the difficulty a little by little if you get it.
Ho presentato la mia candidatura online. La procedura ha richiesto 2 mesi. Ho sostenuto un colloquio presso Microsoft
Colloquio
Process went through 3 rounds and resume shortlisting at first,
Got Online assesment link, In which they asked 2 question of medium level ,Then 2 Technical rounds, both were eliminatory, In first round they asked dsa problem of medium level which I answered well so got shortlisted for 2nd round , Senior developer was on the panel in this round , they asked to code one dsa question which I completed and answered all questions which were asked
Domande di colloquio [1]
Domanda 1
In Online assesment they asked 2 question
one on graphs and other one on arrays
Technical round-1
DSA problem on graphs
Technical round-2
DSA problem on trees and cs fundamentals questions
Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto 2 giorni. Ho sostenuto un colloquio presso Microsoft (Bangalore Rural) nel mese di set 2024
Colloquio
There where 3 rounds 1st online coding followed by techinal interview 1 next hr+tech interview they asked in data structure i passed 1st and 2nd round i got rejected in 3rd round
Domande di colloquio [1]
Domanda 1
return nth element in a binary tree and largest subarray in a array without duplicates