Microsoft - Interview question - If Today Feels Heavy, Read This
Summary
I applied to Microsoft for two different roles and was rejected after the first round for one role, and after the OA for the other. I'm sharing the interview and OA questions to help others prepare and provide motivation on their job search journey.
Full Experience
I applied directly through the careers page. After completing the OA, I was selected for Round 1 (DSA/LLD/PSA) and Round 2 (LLD/HLD) for one role, but unfortunately, I was rejected in Round 1 itself. For another role, I was rejected after the OA. I want to share my knowledge so it doesn't go to waste. I hope this helps others out there. If you feel you aren't getting calls, wait and get ready because when the interview call comes, that's your only chance, so don't waste it. Keep preparing and be ready always! You may receive a call at some point, so don't waste it! I started preparing in February 2025, and here I am in February 2026, still hoping for the best, so keep running! My advice is: don't start if you are going to stop midway! In the past year, I didn't receive a single call, but in the past month, I received nearly 4 calls from Microsoft itself without a referral! So, keep pushing yourself, learn as much as you can! Yes, I didn’t win this time, but I will! I hope this motivates at least one or two people out there like me! All the best, guys! The verdict was rejected in both roles.
Interview Questions (5)
Recover Corrupted Master Page
Each page has metadata:
empty bit → whether page is used
offset of next page → pointer (like a linked list)
Example chain: P1 → P2 → P3 → P10 P2 → P5
Page states:
P1: not empty → next = P3
P2: not empty → next = P5
P3: not empty → next = P10
P4: empty (garbage)
P5: not empty → EOF (sentinel)
P0 = master page It normally stores starting offsets of all files (i.e., heads of each chain).
But P0 is corrupted, and we must reconstruct the master page.
Maximum Number of Alloys (Simplified)
Similar to LeetCode problem 'Maximum Number of Alloys', but simplified to consider only one company (k=1).
Shortest Cycle in a Graph (Variant)
Close to LeetCode problem 'Shortest Cycle in a Graph', but with variations.
Subarrays with K Different Integers
Sum of Subarray Ranges (Variant)
Close to LeetCode problem 'Sum of Subarray Ranges', but with variations.
Preparation Tips
I started preparing in February 2025 and have been continuously preparing since then. Despite not receiving calls for a year, I received four calls from Microsoft without a referral in the past month. My advice is to keep pushing yourself and learn as much as you can, and always be ready for when an interview call comes.