microsoft logo
Microsoft· sde 1 (l60)

Microsoft Interview Experience || SDE 1 (L60) Noida

Result
Offer
Location
noida
Experience
2 years
Posted
19 Nov 2025
492 reads

Summary

I successfully interviewed for an SDE 1 (L60) position at Microsoft in Noida, securing an offer after completing an Online Assessment, two technical rounds (DSA and LLD), and a behavioral round.

How it went

I applied directly on the Microsoft portal, and a recruiter soon contacted me to schedule the Online Assessment.

Step 1: Online Assessment (OA)
I don't recall the exact questions, but they involved a problem on difference arrays and another challenging question on heaps. I managed to solve both and received an invitation for the next rounds.

Round 1: DSA round
This round consisted of three Data Structures and Algorithms questions. The first question involved finding the longest safest path in a string containing lowercase letters and hashes, with a follow-up asking what if one hash could be considered safe. I don't remember the exact details of the second question, but it revolved around string matching and two-pointers. I successfully solved all three problems.

Round 2: LLD
For the Low-Level Design round, I was tasked with designing a Cache. I approached this using Object-Oriented Design principles, emphasizing SOLID principles and implementing a strategy pattern for the eviction policy. I specifically coded for an LRU eviction policy and demonstrated the complete code. The interviewer seemed very impressed with my code quality.

Round 3: AA round
This was a behavioral round led by a very senior engineering manager. Although I expected a mix of technical and behavioral questions, it was entirely focused on behavioral aspects. I answered questions about my project experiences, hackathons, and other standard behavioral inquiries using the STAR technique.

On the same day, I received a call from the recruiter informing me that I had been selected and they extended an offer.

Questions asked (2)

  1. 01

    Longest Safest Path in String with Blockers

    Data Structures & Algorithms

    You are given a string with lowercase letters and hashes. A hash is considered a blocker. Find the longest safest path in that string. Follow up: What if we allow one hash to be considered safe?

  2. 02

    Design Low-Level Design of Cache

    System Design

    Design the low-level architecture for a cache system. Focus on Object-Oriented Design (OOD) principles, SOLID principles, and a strategy pattern for implementing eviction policies. Code for an LRU (Least Recently Used) eviction policy.

How they prepared

I prepared by directly applying for the role and solving relevant problems. For the LLD round, I focused on Object-Oriented Design principles, SOLID principles, and design patterns, specifically implementing an LRU eviction policy. For the AA (behavioral) round, I practiced answering questions using the STAR technique based on my project and hackathon experiences.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Microsoft recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

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