Microsoft L61 | In person drive | Accepted

Result
Offer
Experience
4 years
Posted
27 Aug 2025
339 reads

Summary

I recently completed an interview process at Microsoft for an L61 position within the SharePoint team and successfully received an offer. The interview included a mix of Data Structures & Algorithms, System Design, and an As Appropriate (AA) behavioral round.

How it went

I had an engaging interview experience at Microsoft, spanning multiple rounds, culminating in an offer. Here's how it unfolded:

Round 1: Data Structures & Algorithms + Resume

This round began with a Data Structures & Algorithms problem where I had to solve Populating Next Right Pointers in Each Node. Following that, the discussion shifted to my resume, where I elaborated on my past projects and experiences. The interviewer also asked me some specific questions related to C#.

Round 2: Data Structures & Algorithms

The second DSA round presented two problems. First, I tackled the Bottom View in Binary Tree problem. The second problem was a more straightforward hashmap question that required me to find the maximum occurring element from a given input. After successfully completing the DSA questions, we had a brief non-technical chat.

Round 3: High-Level Design (HLD)

This was a System Design round where I was challenged to design an autocomplete system, similar to what Bing uses. The interviewer was particularly interested in how I would handle a large volume of requests and scalability aspects. The discussion then delved into the CAP theorem, and while there was initial disagreement on my reasoning for prioritizing availability over consistency, we eventually reached a consensus.

Round 4: As Appropriate (AA) Round

The final round, the AA round, typically focuses on the candidate's perceived weakest interview performance. For me, this was the design round. I was asked a trivial question related to a Parking Garage System, which I found easy to answer.

Approximately 2-3 days after completing all rounds, I received an offer from Microsoft.

Questions asked (5)

  1. 01

    Populating Next Right Pointers in Each Node

    Data Structures & Algorithms · Medium

    I was asked to solve the problem of connecting next right pointers in each node of a perfect binary tree.

    Open the problem
  2. 02

    Bottom View in Binary Tree

    Data Structures & Algorithms · Medium

    I was tasked with implementing the bottom view of a binary tree.

    Open the problem
  3. 03

    Maximum Occurring Element

    Data Structures & Algorithms · Easy

    The interviewer presented a basic hashmap question where I needed to find the maximum occurring element in a given input.

  4. 04

    Design Autocomplete System

    System Design · Hard

    I was asked to design an autocomplete system, specifically considering a scenario similar to Bing's autocomplete functionality, and discussing how to handle a large number of requests and ensure scalability.

    Open the problem
  5. 05

    Parking Garage System Design

    System Design · Easy

    In the AA round, I was presented with a design question related to a Parking Garage System, which was described as a trivial problem.

    Open the problem

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!