Challenging, Supportive, But Overflowing
Challenging, Supportive, But Overflowing
Very challenging and educative experience. Amazing people working there. Helping attitude from senior developers.
Sometimes work can overflow to out-of-work hours. Sometimes tech is limited to the Microsoft stack only.
Additional Ratings
Was this helpful?
Microsoft Interview Questions
Microsoft Interview Experiences
Software Development Engineer (SDE)
Standard interview with two coding questions. Had another round with a manager who asked a lot of questions related to my past project experience, which went into a lot of detail.
Software Development Engineer (SDE)
Microsoft’s SDE process usually goes: recruiter screen, (for new grads) an online coding test, then 1–2 technical rounds, followed by a 3–5 interview onsite loop covering coding/algorithms, system or OOP design, and behavioral. After a hiring debrie
Software Development Engineer (SDE)
First, there was an Online Assessment. After cracking the coding round, one question was related to Kadane's algorithm. The second question was related to finding local minima in a grid. I did it in O(N) time complexity and O(log n) space complexity.
Software Development Engineer (SDE)
United StatesNovember 14, 2025Standard interview with two coding questions. Had another round with a manager who asked a lot of questions related to my past project experience, which went into a lot of detail.
Software Development Engineer (SDE)
United States, United StatesOctober 22, 2025Microsoft’s SDE process usually goes: recruiter screen, (for new grads) an online coding test, then 1–2 technical rounds, followed by a 3–5 interview onsite loop covering coding/algorithms, system or OOP design, and behavioral. After a hiring debrie
Software Development Engineer (SDE)
Bengaluru, Karnataka, IndiaOctober 13, 2025First, there was an Online Assessment. After cracking the coding round, one question was related to Kadane's algorithm. The second question was related to finding local minima in a grid. I did it in O(N) time complexity and O(log n) space complexity.
