
Meesho Software Engineer Interview Questions
& Process
Real candidates share what happened, how many rounds they had,
and how the experience turned out.
Based on 188 interview experiences · FREE TO READ
Candidate interview experiences
First-hand accounts from people who interviewed at Meesho.
Software Engineer
Round 1 was an Online Assessment (OA), a 90-105 minute test on HackerRank or HackerEarth with 3 medium-hard DSA problems (tree, graphs, DP). You needed to solve at least 2 fully with optimal solutions to pass all test cases. Round 2 was a Machine Coding session, a 60-90 minute live coding challenge to build a mini-system (like inventory, social feed, or Facebook-like features) using OOP, design patterns, and clean code. After building, you had to discuss trade-offs, test cases, and scalability. Round 3 was a Resume and Basics interview with the hiring manager, lasting 30-45 minutes. It involved deep dives into your resume and projects (especially backend stuff like Java/Spring Boot, Kafka at Meesho), CS fundamentals (caching, ACID), behavioral questions, and some light system design. No heavy coding in this round, but you needed to explain your contributions clearly.
- How would you approach a machine coding question about a voting machine?
Software Development Engineer
So first there was an online assessment with 3 DSA questions that were medium to hard difficulty. After passing that, there were 3 interview rounds. The first round was focused on DSA and LLD. The second round was a Low Level Design round. The last round was with a manager or senior person.
- A DSA question was asked.
- A LLD question similar to a restaurant management system with order tracking and various other features was asked.
- A simple discussion on resume was conducted.
Software Development Engineer
So first there was an online assessment on hackerearch with 3 questions, 2 worth 50 each and the last one worth 100, all using a safe browser. Then Interview 1 was a DSA question. They were looking for a solution based on concepts like binary search which could also be solved using a segment tree, but the constraints required understanding policy-based data structures. I proposed a lower_bound approach and got selected for round 2. Round 2 was an LLD round. The interviewer presented a CarPooling LLD question on HackerEarth and asked me to write code to pass the test cases. I spent too much time explaining and by the end, ran out of time and couldn't get it to run successfully.
- For a DSA question, explain how a binary search concept could be solved using a segment tree, emphasizing the need for policy-based data structure understanding to meet the given constraints.
- Given the CarPooling LLD question on HackerEarth, write code that will pass the test cases.
Meesho Software Engineer Interview Questions
Quoted word for word from Meesho interview reports.
“Given a Binary Search Tree, find a pair of nodes that sum up to a specific target value.”
Read reports →“Given two arrays, find common elements in ascending order. Hashing can be used to solve this efficiently.”
Read reports →“Can you find the size of each island given a 0-1 matrix where 1s form islands?”
Read reports →“Implement a function to add two numbers represented by linked lists without reversing them, likely using a stack.”
Read reports →“Implement a shopping cart with features like add, delete, calculate final amount, and add discount in C++.”
Read report →“Implement the code for the snake and ladders game, which involves completing 3-4 methods.”
Read report →“Design a polling system where a person can cast their vote, making sure to represent it with various classes.”
Read report →“Could you determine if one string is a substring of another, considering all possible cases?”
Read report →“How would you approach the 'Colliding Balls' problem using a stack, given 2 arrays representing ball positions, strengths, and directions on a 1D axis? How many balls would remain after all collisions?”
Read report →Formats, difficulty and experience
Across all 188 Meesho interview reports.