Microsoft | L61 | Noida | Reject

microsoft logo
microsoft
NoidaRejected
April 30, 202216 reads

Summary

I recently interviewed with Microsoft for an L61 role in Noida and unfortunately received a rejection after the fourth round. The interview process included an Online Assessment, two Data Structures & Algorithms rounds, and two Low-Level Design rounds.

Full Experience

I recently completed my interview process with Microsoft for an L61 position in Noida. The process consisted of four rounds, starting with an Online Assessment, followed by two Data Structures & Algorithms (DSA) rounds, and finally two Low-Level Design (LLD) rounds. Unfortunately, I received a rejection after the fourth round, as the feedback from that round was not positive.

Round 1: Online Assessment

The first round was an Online Assessment. It featured two medium-level coding questions. I remember the first one clearly, but unfortunately, the second one has slipped my mind.

Round 2: DSA Round

This round focused on Data Structures and Algorithms. I was given two problems to solve.

Round 3: LLD Round

The third round was dedicated to Low-Level Design. I was asked to design a specific system.

Round 4: Technical Round

The final round also included a mix of questions, one on algorithms and another on Low-Level Design.

After completing all four rounds, I received a call from HR indicating that the feedback for Round 4 was not positive, leading to my rejection.

Interview Questions (6)

Q1
Potholes Problem
Data Structures & AlgorithmsMedium

You are given a string S representing a road. S consists of . (paved) and x (pothole). You also have an integer B representing the maximum number of potholes you can cover. You want to pave the longest possible segment of the road. Return the length of the longest segment you can pave.

Q2
Cousins in Binary Tree
Data Structures & Algorithms

Given the root of a binary tree and the values of two distinct nodes, x and y, determine if they are cousins. Two nodes are cousins if they have the same depth but different parents.

Q3
Find Anagram in String
Data Structures & Algorithms

Given two strings, s1 and s2, determine if s2 contains any permutation of s1 as a substring. In other words, check if any anagram of s1 exists within s2.

Q4
Low-Level Design of Vending Machine
System Design

Design a vending machine system. Consider aspects like coin insertion, product selection, dispensing items, handling change, inventory management, and various states (e.g., idle, product selected, dispense, return change).

Q5
Number of Islands (Image Processing)
Data Structures & Algorithms

Given a binary image (represented as a grid, potentially from a PNG), where '1' represents land and '0' represents water, count the number of distinct islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. Assume all four edges of the grid are surrounded by water.

Q6
Low-Level Design of Spreadsheet
System Design

Design a simplified spreadsheet application. Focus on core functionalities like cell storage, basic formulas (e.g., sum, average), dependency tracking for cell updates, and potentially a user interface component.

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!