Interview experience
Meesho interview experiences covering Online Assessment, Machine Coding / LLD, Technical Round(s), Managerial / HR. Round-wise notes, common questions, and what candidates report clears each stage.
Meesho Interview Questions and Answers (2026)
Meesho is an Indian social commerce and reseller marketplace founded in 2015. It is known for enabling small sellers through WhatsApp-first commerce and a large consumer app. Engineering teams build marketplace, logistics, and seller tools at scale.
Explore: Interview experience · HR interview questions · Overview · Placement papers · Preparation guide
Overview
Meesho’s fresher loop combines a long, multi-problem online assessment with a dedicated low-level-design machine-coding round, then closes with a hybrid round that mixes core CS fundamentals (OS, networks, SQL) back in alongside behavioral questions.
HR interview questions
Meesho HR interview questions with sample answer frameworks - motivation, relocation, STAR stories, and culture-fit prompts.
Meesho interview process at a glance
| Round | Duration | What they test |
|---|---|---|
| Online Assessment | Up to ~165 min | 3 medium-hard coding problems |
| Machine Coding / LLD | ~60 min | Build a working system - class design, clean executable code |
| Technical Round(s) | 45-60 min each | DSA + system design (orders/logistics) + project discussion |
| Managerial / HR | 30-45 min | OS/networks/SQL fundamentals + behavioural fit |
Meesho online assessment: quick answers
These answers are compiled from public candidate reports and prep guides, not from an official Meesho notice, and drives differ. The instruction screen of your own test is the final word.
| Question | Answer |
|---|---|
| How many questions and how long? | Usually 3 coding problems in 90-165 minutes. Campus tests in 2023-2025 ran 90-105 minutes; one 2025 campus test had 4-5 coding and debugging questions in 105 minutes; a March 2025 off-campus SDE trainee test ran 165 minutes with three hard problems. |
| Does it have negative marking? | No public report mentions any. Coding problems are scored on test cases passed. |
| Is there a sectional cutoff? | Not reported. Some drives add MCQs on OS, networks and programming, but candidates describe one combined shortlist. |
| How much is the cutoff? | Not published; shortlists are relative to the batch. Candidate-reported eligibility is often 7.0+ CGPA or 70% with no active backlogs, but your placement notice is the rule. |
| Which platform is it on? | HackerEarth in most campus reports; a March 2024 off-campus SDE-1 backend test was 100 minutes on HackerRank. |
| How hard are the questions? | Medium to hard. Reported problems include longest palindromic subsequence, Task Scheduler, a graph routing problem and a hard backtracking or DP problem, usually alongside one easier array question. |
| Is there machine coding after the OA? | Yes, for most SDE roles. A 2025 campus round gave a ride-sharing system with function signatures already defined and one hour to implement it. |
Meesho interview questions by role
These topics come from Code360, LeetCode Discuss and Glassdoor interview reports and Interview Query’s analyst guide. They show the level and style, not a fixed list.
| Role | Reported questions and topics |
|---|---|
| SDE intern + SDE-1 (campus) | 3-problem OA; a DSA round of 30-90 minutes (binary search, DP, graphs, sometimes segment trees); a one-hour LLD round such as ride-sharing or car-pooling with given signatures; a hiring-manager round on projects with some OS and SQL. |
| SDE-1 backend (off-campus) | 100-165 minute OA with medium-hard problems; machine coding such as in-memory inventory with timeout rollback, car-pooling or parking lot; follow-ups on concurrent stock updates and idempotent orders. |
| SDE-2 and above | Same OA and machine coding, plus a high-level design round on order, catalogue or logistics flows at Meesho’s scale. |
| Business analyst | An online test of 10-12 moderate-to-tough SQL questions plus Python MCQs in one report; SQL on joins, RANK, window functions, CTEs, UNION vs UNION ALL and order of execution; guesstimates such as Domino’s stores in New Delhi; root-cause cases on a metric drop. |
Asked across every role: why Meesho, what you know about its seller and reseller model, and one project or analysis you can defend in detail.
Online Assessment
A long, timed coding test - up to roughly 165 minutes - with 3 medium-hard problems, noticeably more time pressure than a typical single-hour OA.
Common questions
- Array/string manipulation problems at medium-hard difficulty
- Tree and graph traversal problems
- Top-K / heap-based problems (e.g. top-K frequent elements)
Machine Coding / Low-Level Design
Roughly 60–90 minutes building a working system from scratch - candidates report tasks like a car-pooling system, in-memory inventory with blocking/timeout rollback, or a category tree with date-range order queries. The interviewer cares more about how you structured your classes and modules than how fast you finished.
Common questions
- Design and implement a car-pooling or booking-style system with clean class boundaries
- Justify your object-oriented design choices and how you’d extend the system
- Handle edge cases (capacity limits, cancellations, conflicting bookings) in your design
- Explain why the code is clean and executable, not just functionally correct
- Inventory or warehouse LLD with concurrent stock decrement (backend SDE-1 reports)
- Category ingest/query APIs over a tree (segment-tree or Fenwick-style pseudocode acceptable)
Technical Round(s)
Further DSA problems combined with system-design questions scoped to Meesho’s marketplace domain, plus a detailed walkthrough of a resume project.
Common questions
- Shortest path / BFS-style problems on a grid or graph
- System design for order or logistics flows at marketplace scale
- Discussion on catalogue search, reseller workflows, or recommendation systems - inputs, outputs, what breaks at scale
- Your project’s architecture, hardest bug, and what you’d rebuild
Round-by-round narratives are on the Meesho interview experience page.
Managerial / HR round
A closing round that blends core CS fundamentals with behavioral questions - candidates describe being asked about OS, networking, and SQL here, not just motivation and culture fit.
Common questions
- OS fundamentals (processes, scheduling, memory) and basic networking concepts
- SQL query and schema-design questions
- Tell me about a time you made a call with incomplete data in a fast-moving situation
- Describe a conflict with a cross-functional partner (ops, a reseller, or another team) and how you resolved it
Sample answer frameworks for each of these are on the Meesho HR interview questions page.
Meesho campus vs off-campus SDE hiring
Campus drives (often a 6-month internship plus SDE-1 offer) run the OA, a DSA round, a one-hour LLD round and a hiring-manager round, sometimes all within a day. The OA is usually 90-105 minutes on HackerEarth, and interviews lean more on core CS subjects.
Off-campus and referral hiring for SDE-1 backend roles uses a longer or harder OA (100 minutes on HackerRank in one 2024 report, 165 minutes with three hard problems in a 2025 SDE trainee report) and a fuller machine coding round. Senior hires add high-level design. This page covers both routes; the time limits and rounds in your invite take priority over either pattern.
Common technical interview questions and answers
Q: Find the top K frequent elements in an array. What is the optimal approach?
First build a frequency map in one pass, which is O(n) time and O(n) space. Then push entries into a min-heap of size K, popping the smallest whenever the heap exceeds K, so the heap always holds the K most frequent seen so far - that is O(n log K) time and O(K) extra space, better than sorting all distinct elements at O(n log n). If the interviewer pushes for strictly linear time, use bucket sort: create an array of n+1 buckets indexed by frequency, place each element in the bucket matching its count, and walk the buckets from the highest index collecting until you have K, giving O(n). Edge cases to state are K larger than the number of distinct elements, and ties in frequency, where you should ask whether any valid answer is acceptable.
Q: Find the shortest path from a source to a destination cell on a grid with blocked cells.
Because every move costs the same, use breadth-first search rather than Dijkstra. Push the source into a queue with distance 0 and mark it visited, then repeatedly pop a cell and push its unvisited, in-bounds, unblocked neighbours with distance plus one; the first time you pop the destination, that distance is the shortest path. It is O(rows times columns) time and space since every cell is enqueued at most once. Marking a cell visited at enqueue time rather than dequeue time is what stops duplicates blowing up the queue. If edge weights differed you would need Dijkstra with a priority queue at O(E log V), and if some moves cost 0 and others 1, a deque-based 0-1 BFS is the right tool.
Q: In the machine coding round, how would you structure the classes for a car-pooling system?
Model the nouns first, then the service that coordinates them. Entities: User (id, name, contact), Vehicle (registration, model, capacity, owner), Ride (id, driver, vehicle, source, destination, seatsAvailable, status), and Booking (id, ride, rider, seats, status). Behaviour goes into a RideService that offers createRide, searchRides and bookRide, backed by repository interfaces so the in-memory store can be swapped later. Keep matching logic behind a MatchingStrategy interface (nearest-source, cheapest, fewest-detours) so a new rule is a new class rather than an edit to an if-else chain - that is the open-closed principle the grader is looking for. Seat availability must be decremented atomically and validated against capacity, and cancellations must return seats, since those are the edge cases Meesho interviewers probe.
Q: Write a SQL query for the top 3 selling products in each category.
Use a window function to rank within each partition, then filter on the rank in an outer query, because window functions cannot be used in a WHERE clause: SELECT category, product, units FROM (SELECT category, product, units, ROW_NUMBER() OVER (PARTITION BY category ORDER BY units DESC) AS rn FROM product_sales) t WHERE rn <= 3; Use RANK() instead of ROW_NUMBER() if tied products should all be returned, and DENSE_RANK() if you do not want gaps in the ranking numbers. On a large sales table an index on (category, units DESC) lets the engine feed rows to the window in order and avoids a full sort.
Q: What is the difference between preemptive and non-preemptive scheduling, and what happens during a context switch?
Under non-preemptive scheduling a running process keeps the CPU until it blocks or exits, as in first-come-first-served or plain shortest-job-first; under preemptive scheduling the kernel can take the CPU away on a timer interrupt or when a higher-priority process becomes ready, as in round-robin and preemptive shortest-remaining-time-first. Preemption gives much better response time for interactive workloads at the cost of more switching overhead. On a context switch the kernel saves the current process’s registers and program counter into its process control block, updates its state, selects the next process, restores that process’s saved context, and switches the page-table base register - which also flushes or invalidates TLB entries. That TLB and cache cost is why an excessively small round-robin time quantum destroys throughput.
Q: Compare TCP and UDP, and explain the TCP three-way handshake.
TCP is connection-oriented and reliable: it numbers bytes, acknowledges them, retransmits what is lost, delivers in order, and applies flow control through the receive window plus congestion control such as slow start and AIMD. UDP is a thin datagram wrapper with no connection, no ordering, no retransmission, and an 8-byte header instead of TCP’s 20, so it is used where late data is worthless - live video, voice, DNS queries, telemetry. The handshake establishes sequence numbers: the client sends SYN with its initial sequence number, the server replies SYN-ACK carrying its own sequence number and acknowledging the client’s, and the client sends ACK. Three messages are needed because both directions must have their starting sequence number acknowledged before data can be reliably tracked.
Q: How would you make order placement idempotent so a retried request does not create duplicate orders?
Have the client generate an idempotency key - a UUID created once per checkout attempt and reused across retries - and send it as a header. On the server, write that key into a table with a unique constraint in the same database transaction that creates the order, so a duplicate request loses the race on the unique index and can be answered with the stored original response instead of creating a second order. Store the response body and status against the key with a TTL of about 24 hours so retries after a network timeout are safe. Relying on a read-then-write check instead of the unique constraint is the common wrong answer: two concurrent retries can both read no-existing-order and both insert. Downstream events should also carry the order id so consumers can deduplicate.
Q: How does catalogue search actually work at marketplace scale?
The core structure is an inverted index: each product’s title and attributes are tokenised, normalised (lowercased, stemmed, synonyms applied), and each token maps to a posting list of the product ids containing it. A query is tokenised the same way, the posting lists are intersected or unioned, and candidates are scored - classically by BM25, which rewards term frequency in the document and rare terms, and penalises long documents. That candidate set is then re-ranked with business signals such as popularity, price competitiveness, seller rating and conversion rate, which is where a marketplace differs from generic text search. At scale the index is sharded across nodes and queried in parallel, results are merged, and a cache fronts the head queries, since search traffic is heavily skewed towards a small set of popular terms.
Q: How do you merge overlapping delivery or pickup time slots?
Model each slot as [start, end], sort by start, and merge when the next slot begins before or at the current merged end - classic interval merge in O(n log n). For Meesho logistics flavour, mention seller dispatch windows, hub cut-off times, or reseller pickup batches. Clarify whether touching endpoints merge (10:00–11:00 and 11:00–12:00). After merging, validation checks can ensure no slot exceeds driver capacity.
Q: How do you check whether a graph is bipartite (common in Meesho tech screens)?
Run BFS or DFS coloring with two colors: start each unvisited component, assign color 0, flip color for neighbors. If you ever try to color a neighbor the same as the current node, the graph is not bipartite. For undirected graphs this detects odd-length cycles. Complexity O(V + E). Open-campus 2025 accounts report a 30-minute tech round dedicated to this pattern - practice explaining edge cases (disconnected graph, single node).
Q: Design an in-memory inventory system with rollback on timeout.
Entities: Product (sku, availableQty), Reservation (id, sku, qty, status, expiresAt), and InventoryService with reserve, confirm, and release. On reserve, decrement available qty inside a synchronized block or lock per sku, create reservation with expiry timestamp, and schedule a timer to release if not confirmed. Confirm moves reservation to fulfilled; release restores qty. Meesho backend write-ups describe 90-minute machine rounds with similar concurrency stories - emphasize testable service methods and clear state transitions over micro-optimizations.
Frequently asked questions about Meesho interviews
Does the Meesho online assessment have negative marking?
No public report mentions negative marking. The Meesho SDE OA is usually 3 coding problems (sometimes 4-5 coding and debugging questions) scored on test cases, so attempt every problem and submit partial solutions.
How long is the Meesho online assessment and which platform is it on?
Between about 90 and 165 minutes, depending on the drive. Campus tests in 2023-2025 ran 90-105 minutes, mostly on HackerEarth; a March 2024 off-campus SDE-1 test ran 100 minutes on HackerRank; and a March 2025 off-campus SDE trainee test ran 165 minutes with three hard problems.
What is the Meesho interview process for freshers?
Meesho’s process typically runs 4-5 stages: 1. Application (on-campus via college placement cell, off-campus via Meesho Careers, or referral). 2. Online Assessment (up to ~165 min) - 3 medium-hard coding problems. 3. Machine Coding / Low-Level Design round (~60 min) - build a working system from scratch (e.g. a car-pooling or booking system), judged on class design and clean, executable code. 4. Technical Interview(s) - further DSA, system design, and project discussion. 5. Managerial/HR round - technical-cum-behavioral questions covering OS, networks, SQL, plus culture fit and offer. Total duration is roughly 2-3 weeks.
What questions are asked in Meesho interviews?
The Online Assessment leans on medium-hard array, string, tree, and graph problems. Machine coding rounds ask you to design and build a working system - candidates report tasks like a car-pooling system - graded on class structure and whether the code runs cleanly, not just the approach. Technical rounds also probe domain topics like catalogue search, reseller workflows, and recommendation systems in plain language. The closing round mixes OS, computer networks, and SQL fundamentals with behavioral questions on ownership and ambiguity.
How many rounds are there in the Meesho interview?
Meesho typically runs 4-5 touchpoints: an Online Assessment, a Machine Coding/LLD round, one or two further Technical Interviews (DSA, system design, project deep-dive), and a closing Managerial/HR round that often blends technical fundamentals with behavioral questions. Some drives compress stages depending on role and experience level.
What is the Meesho technical interview like?
The Machine Coding round (about 60 min) focuses on low-level design - candidates report being asked to build a working car-pooling or similar system, with the interviewer more interested in class/module structure and whether the code is clean and executable than in raw speed. Later technical rounds add system-design questions scoped to Meesho’s marketplace domain (orders, logistics, catalogue search) plus a deep project discussion. The closing round often circles back to OS, networking, and SQL fundamentals alongside behavioral questions.
How should I prepare for Meesho interviews?
Practice medium-hard DSA across arrays, strings, trees, and graphs for the OA. For the machine coding round, practice designing and building small systems end-to-end with clean class boundaries rather than just getting something to run. Revise OS, computer networks, and SQL fundamentals, since Meesho’s later rounds test them directly alongside behavioral questions. For domain questions, be ready to explain catalogue search or reseller workflows in plain language - inputs, outputs, what breaks at scale.
What mistakes do candidates commonly make in Meesho interviews?
Coding before clarifying constraints in the OA, treating the machine-coding round as a race instead of a design exercise (Meesho graders explicitly weigh class structure over speed), and treating the closing HR/managerial round as a formality when it still tests OS/networking/SQL fundamentals. Candidate reports consistently note that a clear, working low-level design beats a fast but disorganised one.
How to prepare for Meesho interviews
- Loop map: Online Assessment; Machine Coding / LLD; Technical Round(s); Managerial / HR. Confirm timings from the drive mail.
- Technical depth: Drill the Q&A section until answers are spoken, not read. Know every resume project cold.
- Experiences: Study round-wise notes on the interview experience page - real prompts beat generic lists.
- HR: Three STAR stories + a specific “Why Meesho?” on the HR page.
A practical Meesho prep plan
Use this as a default four-week loop before a Meesho drive. Adjust to your invite timeline.
- Week 1: Timed aptitude + one easy coding problem a day, plus a one-page cs fundamentals sheet. Open the Meesho previous-year sets on this site and mark which sections ate your time. Write the timing on a sticky note. That number is more useful than a 200-problem LeetCode streak you never timed.
- Week 2: Most Meesho drives fail people on the first timed paper or OA. Do three timed sits this week. After each one, log every miss in a two-column note: topic and why (slow, wrong formula, bad edge case, panic). The next sit should only add problems from that log.
- Week 3: Technical interviews at Meesho usually want a clean project story, one or two CS fundamentals, and (if the process has it) a behavioral or values round. Write STAR stories on paper, not in your head. Practise “Why Meesho?” with one concrete product, lab, or business line - not a slogan.
- Week 4: Two full mocks, then only error-log topics - no new patterns. If you still have energy, redo only the questions you failed in week 2.
10-day crash version: Days 1-4 timed DSA, days 5-7 resume projects + CS fundamentals, days 8-9 mock interviews out loud, day 10 HR STAR stories on the HR page.
Compensation notes
Candidate-reported fresher/early-career packages for Meesho often cite ₹25-35 LPA SDE-1 band. Treat forum numbers as ranges, not guarantees - confirm the written offer letter for your team and location.
Who usually fits and who struggles
Good fit: You clear medium DSA (graphs, DP, sliding window appear often), you can implement marketplace LLD (inventory reservation, cart, orders) without over-engineering, and you think about reseller/COD/low-bandwidth constraints when design prompts allow.
Harder path: You only do abstract FAANG design; you ignore concurrency and idempotency; you have no metric-backed ownership story.
Red flags in the Meesho loop
- Microservices theatre before a clear domain model and state machine
- Inventory designs that cannot handle payment timeout or double booking
- Silent machine-coding with untested happy paths only
- “Why Meesho?” with no social-commerce or Bharat-scale angle
Sources
Interview process details and sample questions on this site are editorially organized from public candidate reports and hiring write-ups, with round structure, prep notes, and company-specific framing added by our team. For round-by-round stories, see the Meesho interview experience page. For OA papers and coding drills, use Meesho on placementpapers.app. OA quick answers and role-wise questions draw on Code360 and LeetCode Discuss Meesho interview experiences (2023-2025), Glassdoor reviews for Meesho SDE and business analyst roles, Design Gurus’ Meesho round-by-round guide and Interview Query’s Meesho business analyst guide.