Microsoft Interview
- Result
- Ongoing
- Posted
- 31 Oct 2025
290 reads
Summary
I had a Microsoft DSA interview where I solved both coding problems correctly. My solutions were not optimal, but I'm curious about my chances of clearing the round.
How it went
In my Microsoft DSA interview, I solved both coding problems correctly.
Q1: My solution was O(N²), while the optimal is O(N log N) — I couldn’t reduce it further during the interview.
Q2: My solution was O(N), while the optimal is O(log N).
Given this, what are the chances of clearing the round ?
Questions asked (2)
- 01
Optimal O(N log N) Solution for a Problem
Data Structures & Algorithms
My solution was O(N²), while the optimal is O(N log N) — I couldn’t reduce it further during the interview.
- 02
Optimal O(log N) Solution for a Problem
Data Structures & Algorithms
My solution was O(N), while the optimal is O(log N).