Skip to content
Interview Questions

Meesho Interview Experience 2026

How Meesho fresher SDE interviews usually run, campus and off-campus, synthesized from GeeksforGeeks and Medium write-ups. We reorganized long OAs, machine-coding rounds, and final hybrid filters - treat this as a prep map, not a script.

Meesho placement process includes: 1. Application (on-campus via college placement cell, off-campus via Meesho Careers portal, or through referrals), 2. Online Assessment (OA) - 2-3 coding problems (often 90-165 minutes), 3. Technical Interviews - DSA, projects, fundamentals, 4. Machine Coding / LLD - runnable class design, 5. Managerial / HR hybrid - behavioral plus OS/networks/SQL again. Total duration: 2-3 weeks from application to offer letter.

Eligibility (from student reports): 7.0+ CGPA in 10th, 12th, and graduation.

Fresher package ballpark (from student reports): SDE-1: ₹25-35 LPA. Confirm on your offer letter.

Round-wise process

Round Duration What they test
Online Assessment 90–165 min 2–3 coding problems + sometimes OS/network MCQs
Technical Round 1 30–90 min DSA (graphs, DP, greedy) + project discussion
Machine Coding / LLD 60–90 min Runnable class design (carpool, inventory, category orders)
Technical Round 2 / HM 45–60 min SQL schema, CS fundamentals rapid-fire, system design
HR / final hybrid 30–45 min Behavioural + OS/networks/SQL again + culture fit

Real interview experiences

These are rewritten from public student write-ups. Two things recur across almost every Meesho account, so plan around them: the coding round is long and genuinely hard (not a 2-easy-questions screen), and the round most people underestimate is a machine-coding / low-level-design round, not a distributed-systems whiteboard.

Experience 1: SDE-1, on-campus (selected)

Source: Meesho Interview Experience for SDE-1, On-Campus (Virtual) - GeeksforGeeks

Round 1 - coding + MCQs

  • 3 coding problems plus ~20 MCQs on OS, networking, and programming.
  • Reported problems: common elements across arrays, minimum changes to make strings anagrams, and weighted job scheduling (a DP problem, not a warm-up).
  • 15 candidates cleared this stage.

Round 2 - technical (~1.5 hours)

  • Activity selection via greedy - solved in about 15 minutes.
  • A harder “water the plants” simulation problem that took 30-40 minutes, with the interviewer giving hints along the way. Being coachable mattered as much as being fast.
  • Then general OS and DBMS questions. 9 candidates moved on.

Round 3 - technical 2 (~1 hour)

  • Design a database schema for one of their own projects and write SQL queries against it.
  • One coding question solved with DFS.
  • Rapid-fire fundamentals: ARP, DNS, OSI layers, semaphores vs mutexes, paging and virtual memory, threading, SQL vs NoSQL, normalisation, ACID. 4 candidates reached HR.

Round 4 - HR

  • The candidate described it as close to a formality at that point.

Result: Selected.

Takeaways

  • What decided it: Clearing a hard OA (including DP), staying coachable on the water-plants simulation, then surviving schema/SQL design plus rapid-fire ARP/DNS/OS fundamentals
  • Common fail: Freezing when the interviewer hints; weak networking/OS flashcards before the third technical
  • How to practise: 3-problem long OA mocks; activity-selection + DFS drills; design SQL for your own project

Experience 2: SDE-1, open campus 2025 (rejected after the final round)

Source: Meesho SDE-1 Open Campus Interview Experience 2025 - GeeksforGeeks

  • Screening: resume evaluation, with the coding round hosted on HackerEarth.
  • Coding round: 165 minutes, three questions - two medium and one hard. Other 2025 accounts report a similar shape (roughly 105-165 min, 3 problems, topics like binary search, DP, and segment trees), plus in some drives a short MCQ/aptitude stage on Meesho’s NextLevel app before it.
  • Technical interview (~30 min): a medium DSA problem on bipartite graphs.
  • Machine coding round (60 min): implement a working design - this candidate got a car-pooling system; another 2025 account reports an inventory management system in 90 minutes. Expect to write real, runnable, class-structured code under time pressure.
  • HR round: projects, internships, and a spread of OS, computer networks, and SQL questions - not a formality in this drive.

Result: Not selected, despite clearing every prior round. Worth knowing: reaching HR at Meesho is not the same as an offer.

Takeaways

  • What decided it (for others who convert): Runnable LLD under 60–90 minutes plus fundamentals that still hold in the final hybrid
  • Common fail: Treating the last HR/managerial hybrid as soft when it retests OS, networks, and SQL
  • How to practise: Timed carpool/inventory machine coding; bipartite-graph mediums; fundamentals flashcards the night before every round

Experience 3: SDE-1 Backend, on-campus (selected - author hire)

Source: Meesho interview Experience (SDE-1 Backend) - Medium

Round 1 - OA (120 min, HackerRank)

  • Three coding problems; platform timing similar to other 2024–2025 backend drives.

Round 2 - Machine coding (90 min, live)

  • Interviewer present while you build; expect inventory or booking-style LLD with concurrency undertones.

Round 3 - Technical + hiring manager (60 min)

  • Deep dive on design choices from machine coding, resume projects, and fundamentals.

Result: Selected (author joined Meesho as SDE).

Takeaway: Backend track may allocate longer machine coding than the 60-minute carpool reports from open campus - prepare both 60- and 90-minute builds.

Experience 4: SDE-1 Backend, on-campus (composite from interviewexperiences.in)

Source: Meesho SDE-I Backend full experience

OA highlights

  • Mix of array simulation, graph connectivity with binary search + DSU, and digit-DP on large numeric strings - harder than “two mediums only.”

Machine / design prompts reported

  • Category tree with IngestOrder(date, qty, category) and range queries on order counts.
  • Carpooling system class design (overlaps with open-campus 2025).

Result: Offer after multi-round funnel.

Takeaway: Meesho backend OAs are not uniform difficulty - if one problem looks like competitive programming, budget time and partial credit strategy.

Experience 5: Open campus 2025 - HR rejection after strong tech

Source: My Interview Experience with Meesho - SDE-1 Open Campus 2025 - Medium

  • Cleared 165-minute OA, bipartite graph tech, and carpool machine coding.
  • Final HR + technical hybrid still tested OS, networks, SQL, and motivation.
  • Rejection arrived hours later with limited feedback.

Takeaway: Prepare fundamentals flashcards for the final day, not only LLD - several 2025 candidates describe losing offers here.

What these accounts have in common

  • The coding round is the real filter and it is long. Practise 3-problem, 2-hour-plus sets rather than single 45-minute problems.
  • Core CS is asked in depth, not as small talk - OS, networking, and DBMS come up in every write-up.
  • The LLD / machine-coding round rewards clean class design and working code over clever algorithms.

Questions that come up often

Coding / technical

  1. Top-K frequent elements. Usually expects heap / bucket sort
  2. Shortest path in a grid. Usually expects BFS
  3. Merge overlapping delivery slots. Usually expects interval merge
  4. Discussion on catalogue search and reseller workflows, bottlenecks, failure modes, simple APIs
  5. Detailed project discussion, architecture, hardest bug, what you would change

HR / behavioural

  1. Why this product?
  2. Working with unclear requirements
  3. On-call or weekend comfort
  4. Relocation

Practical tips for Meesho

  • Clear the screening round first. Timed practice beats last-minute topic hopping.
  • For domain questions, explain catalogue search in plain language, inputs, outputs, what breaks at scale.
  • OOPs and SQL still open a lot of Meesho panels. Do not skip fundamentals.
  • HR answers should be concrete. One story with a result beats five slogans.
  • If you do not know something, say so and outline how you would find out.

HR interview

After technical rounds, Meesho usually closes with a short HR / hiring-manager conversation: motivation, location, notice period, and a couple of behavioural stories. Prepare those answers on the dedicated page rather than cramming them into this hub.

Sample answers for high-frequency questions

Use these as frames, not scripts - interviewers probe follow-ups.

Q. Find the top K frequent elements in an array. What is the optimal approach?
A. 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.
A. 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?
A. 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.
A. 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. Is the graph bipartite?
A. BFS/DFS two-coloring: assign color 0 to the start node, flip for neighbors; if a neighbor already has the same color, return false. Check all components. O(V + E). Meesho open-campus 2025 reports a dedicated 30-minute round on this pattern.

Q. Merge overlapping delivery slots.
A. Sort intervals by start, merge when current.start <= last.end, extend last.end = max(last.end, current.end). O(n log n). Relate to seller pickup windows or hub dispatch batches.

Q. What is the difference between preemptive and non-preemptive scheduling, and what happens during a context switch?
A. 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.

Tips from successful candidates

Assessment tips

  • Confirm the current Meesho pattern from the drive mail before practising old papers
  • Finish one problem or section fully before starting the next
  • Revise the fundamentals listed in the round table on this page

Interview tips

  • Narrate trade-offs; expect “why” after every answer
  • Only list projects you can defend under follow-ups
  • Prepare 3-4 STAR stories for behavioural prompts

HR tips

  • Know why Meesho, not just why the industry
  • Be clear on location / notice period / higher studies
  • Practise answers on the dedicated HR page

Sources

Round-wise notes synthesize public Meesho candidate reports, then add prep takeaways and outcome context. Cross-check timings against your drive mail. Citation inputs:

For OA practice, see Meesho placement papers.

Meesho hub

HR interview questions

Placement papers

Preparation guide

Similar companies

Flipkart · Zomato · Swiggy · Paytm · Phonepe · Razorpay