Microsoft Interview

microsoft logo
microsoft
DSAOngoing
October 31, 202518 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.

Full Experience

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 ?

Interview Questions (2)

Q1
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.

Q2
Optimal O(log N) Solution for a Problem
Data Structures & Algorithms

My solution was O(N), while the optimal is O(log N).

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!