Meesho Full Interview Experience | SDE-I (Backend) | On-Campus
Summary
I successfully secured an SDE-I (Backend) offer from Meesho through on-campus placements, navigating an online assessment, two technical interviews, a machine coding round, and a final interview covering resume, CS fundamentals, and behavioral aspects.
Full Experience
My interview process for the SDE-I (Backend) role at Meesho, as part of campus placements, consisted of an Online Assessment followed by three in-person interview rounds.
Round I – Online Assessment (DSA)
This round had three questions. I managed to solve all three questions and was subsequently shortlisted for the next round. The problems involved array manipulations with queries, a modified graph connectivity problem, and a digit DP problem.Round II – Technical Interview (DSA)
In this round, I was given a problem involving a tree-like category structure and had to implement a system to ingest orders and query order counts within date ranges for specific categories. I solved this in approximately 25 minutes, providing pseudocode as requested.Round III – Machine Coding
This round challenged me to design a carpooling system. Although I slightly over-engineered a few classes and couldn't run the code within the given time, the interviewer appreciated my approach and thought process. I cleared this round as well.Round IV – Resume + CS Fundamentals + Behavioural Interview
This final round involved discussions about my resume and previous internship experiences, delving into my tech stack, motivations, and design choices. We also covered fundamental computer science topics like processes vs. threads, comparisons between C, C++, Java, and Python, and networking layers. Additionally, I answered several behavioral questions. I successfully cleared this round.Interview Questions (5)
You are given an integer array of size n, where the i-th element represents the capacity of the i-th room. You are also given an array of queries. Initially, you are at the first element. There are 3 types of queries:
- Type 1: Given X → Move the current position X rooms to the right.
- Type 2: Given Y → Move the current position Y rooms to the left.
- Type 3: Given A and B → If you are at the i-th element, remove the room at position i+1 and add 2 new rooms immediately to the right of room i with capacities A and B.
Constraints: n ≤ 10^5 , q≤ 10^5
Topics Involved: Arrays, Doubly Linked List
You are given a string of length 10^4 representing a large number and another number X (in the range [1,100]), and Q queries (Q ≤ 10^6). Each query contains a number K (0,99). For each query, determine whether there exists a subsequence such that the number formed by the subsequence modulo X equals K.
Topics Involved: Digit DP
I was given a tree-like structure where each node represents a category, and its children represent subcategories, for example:
Fashion
|
|-------Mens
| |--->Shirts
| |--->Round Neck
| |--->V Neck
|
|-------Womens
|--Dresses
|--Jeans- Max Depth: 20
- Large number of nodes
- Type 1:
IngestOrder(Date, Quantity, Category)– An order with quantity Q of category C placed on date D. - Type 2:
Query(Category, StartDate, EndDate)– Returns the number of orders of that category within the date range [StartDate, EndDate].
Topics Involved: DFS, Segment Tree/Fenwick Tree (BIT)