As a Software Engineer at Meesho, you are at the heart of India’s fastest-growing social commerce platform. Your work directly impacts millions of entrepreneurs and small business owners, enabling them to reach customers across the country through a seamless, high-scale digital marketplace. You will tackle complex technical challenges involving massive transaction volumes, inventory management, and real-time logistics, all while ensuring a smooth user experience on a massive scale. This role requires a blend of deep technical proficiency and an entrepreneurial mindset. You will not just be writing code; you will be architecting systems that solve real-world problems for a diverse user base. Whether you are working on the full-stack infrastructure for our mobile applications or optimizing backend services for high-concurrency events, your contributions will be central to Meesho’s mission of democratizing internet commerce.
Initial Screening
reportedThe process begins with an initial screening to assess your qualifications and fit for the role.
What to demonstrate
- The process begins with an initial screening to assess your qualifications and fit for the role
- Depth in Data Structures & Algorithms (DSA)
How to prepare
- Be able to walk your CV end to end in two minutes, and say why this company specifically.
- Have your salary expectations, notice period and location constraints ready, and ask for the rest of the loop in writing.
Technical Rounds
reportedCandidates undergo intensive technical rounds that focus on hands-on coding and architectural thinking.
What to demonstrate
- Candidates undergo intensive technical rounds that focus on hands-on coding and architectural thinking
- Depth in Data Structures & Algorithms (DSA)
How to prepare
- Answer aloud and timed: Demonstrate proficiency in handling edge cases and optimizing time/space complexity.
- Answer aloud and timed: Discuss brute force approaches versus optimal O(n) or O(log n) solutions for string and graph-based problems.
Machine Coding Assessment
reportedSpecialized assessments for machine coding are conducted to evaluate coding skills under pressure.
What to demonstrate
- Specialized assessments for machine coding are conducted to evaluate coding skills under pressure
- Depth in Data Structures & Algorithms (DSA)
How to prepare
- Answer aloud and timed: Create a functional Stock Broker Application with support for order management and user portfolios.
- Answer aloud and timed: Design an Inventory Management System that handles product updates, stock tracking, and concurrency.
Final Technical Evaluation
reportedThe process concludes with a final technical evaluation to ensure all skills are thoroughly assessed.
What to demonstrate
- The process concludes with a final technical evaluation to ensure all skills are thoroughly assessed
- Depth in Data Structures & Algorithms (DSA)
How to prepare
- Answer aloud and timed: Demonstrate modular coding practices, including class design, interface usage, and clean API structures.
- Answer aloud and timed: Explain trade-offs in your design, such as why you chose a specific database schema or concurrency model.
2 candidate reports. Individual accounts describe a particular role and hiring cycle.
Meesho Software Engineer interview: SDE-1 problem solving
I interviewed for an SDE-1 full-stack role at Meesho after applying through the career portal and being shortlisted. The first round focused on problem solving and felt like a standard technical screen. One detail I kept being reminded about was logistics: I needed a backup internet connection for the interviews. It did not change the technical content, but it affected how I prepared and how I ma…
Read full experienceMeesho Software Engineer interview: structured real-work questions
I applied for a Software Developer role at Meesho and went through a well-structured interview sequence, although it did not lead to an offer. The interviewers were professional and grounded, and their questions seemed tied to real engineering work rather than abstract trivia. The flow stayed organized throughout, and it was easy to engage with the team while still being pushed on relevant subjec…
Read full experiencePracHub editorial advice for the preparation topics above.
Communicate your thought process
Even if you are working on a tricky algorithm, talk through your logic. Interviewers often value your approach as much as the final code.
Focus on readability
During the machine coding round, a clean, readable, and well-structured project is often better than a "hacky" solution that does more but is hard to maintain.
Know your resume
Be prepared to discuss the challenges you faced in your previous projects and the specific technical trade-offs you made.
Prepare for ambiguity
Real-world engineering is rarely perfectly defined. Practice asking clarifying questions to narrow down requirements.
Choose a category, try a prompt, then open its approach, worked solution or follow-up when you need it.
Solve problems involving arrays and sequences, such as optimizing the efficiency of processors arranged in a r
Solve problems involving arrays and sequences, such as optimizing the efficiency of processors arranged in a row.
Approach
- Restate the input: its shape, its size, and what is guaranteed about it.
- Name the brute-force solution and its complexity before improving on it.
- Choose the data structure from the access pattern, not from familiarity.
- State the target complexity and say which constraint rules the naive version out.
Follow-up
- How does this change if the input no longer fits in memory?
- What is the worst case, and how likely is it on real data?
Implement solutions for challenging problems commonly found on competitive coding platforms.
Implement solutions for challenging problems commonly found on competitive coding platforms.
Approach
- Restate the input: its shape, its size, and what is guaranteed about it.
- Name the brute-force solution and its complexity before improving on it.
- Choose the data structure from the access pattern, not from familiarity.
- State the target complexity and say which constraint rules the naive version out.
Follow-up
- How does this change if the input no longer fits in memory?
- What is the worst case, and how likely is it on real data?
Demonstrate proficiency in handling edge cases and optimizing time/space complexity.
Demonstrate proficiency in handling edge cases and optimizing time/space complexity.
Approach
- Restate the input: its shape, its size, and what is guaranteed about it.
- Name the brute-force solution and its complexity before improving on it.
- Choose the data structure from the access pattern, not from familiarity.
- State the target complexity and say which constraint rules the naive version out.
Follow-up
- How does this change if the input no longer fits in memory?
- What is the worst case, and how likely is it on real data?
Discuss brute force approaches versus optimal O(n) or O(log n) solutions for string and graph-based problems.
Discuss brute force approaches versus optimal O(n) or O(log n) solutions for string and graph-based problems.
Approach
- Restate the input: its shape, its size, and what is guaranteed about it.
- Name the brute-force solution and its complexity before improving on it.
- Choose the data structure from the access pattern, not from familiarity.
- State the target complexity and say which constraint rules the naive version out.
Follow-up
- How does this change if the input no longer fits in memory?
- What is the worst case, and how likely is it on real data?
Explain trade-offs in your design, such as why you chose a specific database schema or concurrency model.
Explain trade-offs in your design, such as why you chose a specific database schema or concurrency model.
Approach
- Say what the runtime actually does before reasoning about the code.
- Name what is shared across threads and what owns each piece of state.
- Identify the window where an invariant is briefly untrue.
- Distinguish a value from a reference to it, and say which one you handed out.
Follow-up
- What happens if two callers reach this at the same time?
- Where could this allocate more than you expect?
Keep soft-deleted accounts from blocking re-registration
app_user holds user_id, tenant_id, email CITEXT, password_hash (NULL for SSO principals), email_verified_at, auth_version, status ('invited','active','suspended','deactivated'), created_at, updated_at, deleted_at. Two live accounts for one address inside a tenant must be impossible, but an address freed by a soft delete must be reusable, and the same tenant may delete and re-register it repeatedly. Write the uniqueness DDL for PostgreSQL 16, then the equivalent for MySQL 8 where partial indexes do not exist, and say what each permits once three deleted rows already hold that address.
Approach
- Start from what is actually unique: not (tenant_id, email), but (tenant_id, email) among live rows. PostgreSQL says that directly — CREATE UNIQUE INDEX app_user_live_email ON app_user (tenant_id, email) WHERE deleted_at IS NULL. A full constraint over the same two columns burns the address permanently the first time someone deletes an account.
- Keep case-insensitivity in the type or the index, never in the application: CITEXT as given, or UNIQUE (tenant_id, lower(email)) as an expression index where the extension is unavailable. A case-sensitive unique column is exactly how two accounts for one human appear.
- For MySQL 8 the predicate has to move inside the key: add a discriminator column that is a constant 0 while the row is live and is set to user_id on delete, with UNIQUE (tenant_id, email, deleted_marker). Live rows share the constant and still collide; deleted rows differ from each other and stop colliding.
- State the NULL variant and its dependency: leaving the marker NULL for deleted rows also works, because a unique index treats NULLs as distinct — true in MySQL, and true in PostgreSQL only under the default NULLS DISTINCT, which PostgreSQL 15 lets you reverse. Check the polarity against the three existing deleted rows: constant-on-live is what preserves the collision you want, and reversing it silently admits duplicate live accounts.
Follow-up
- A deleted account re-registers with the same address the next day. Do the old resource rows follow the new user_id, and how does the API keep the two principals apart?
- How do you honour an erasure request while resource_revision.actor_user_id still references this table?
Stop tag and share joins from fanning out a page
resource_tag is (resource_id, tag_id) with PK (resource_id, tag_id); resource_share is (resource_id, shared_with_user_id, permission). The tagged-and-shared listing inner-joins resource to both, filters tenant_id, tag_id = ANY($2) and shared_with_user_id = $3, orders by updated_at DESC and takes 50. Pages come back with fewer than 50 distinct resources and the total in the header is far too high. Explain the row multiplication, rewrite both the page query and the count query so each is correct, and name the index each one needs. PostgreSQL 16.
Approach
- Do the arithmetic against the predicates that are actually there. An inner join emits one row per matching child row, and both joins are filtered: tag_id = ANY($2) admits only the requested tags, shared_with_user_id = $3 admits one user's share rows. So a resource holding three of the requested tags and shared with $3 once yields three rows, not one — the multiplier is its count of matching tags times its share rows for that single user, and that second factor is 1 unless the table admits duplicate (resource_id, shared_with_user_id) pairs. LIMIT 50 then limits rows rather than resources, and COUNT(*) counts pairs — the header is the product, not the population.
- Reject DISTINCT as the fix. It deduplicates after the product has been built, so the planner must materialise and sort the fanned-out set before the LIMIT can apply, and it leaves any SUM or AVG in the same select list wrong.
- Rewrite both filters as semi-joins, keeping resource as the only row source: AND EXISTS (SELECT 1 FROM resource_tag rt WHERE rt.resource_id = r.resource_id AND rt.tag_id = ANY($2)) and the same shape against resource_share. A semi-join stops at the first match per resource and preserves the driving index order, so ORDER BY updated_at DESC, resource_id DESC LIMIT 50 still stops after 50 rows.
- Count with the same predicates and no join at all: SELECT count(*) FROM resource r WHERE r.tenant_id = $1 AND r.status = 'active' AND EXISTS (...) AND EXISTS (...). Nothing multiplies a resource, so the number is the population.
Follow-up
- The filter changes from 'any of these tags' to 'all of these tags'. Rewrite it and state what it costs relative to the ANY form.
- A resource can be shared with the same user twice under different permissions. Does your count change, and should it?
Create a functional Stock Broker Application with support for order management and user portfolios.
Create a functional Stock Broker Application with support for order management and user portfolios.
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- State the consistency you need, and where you are willing to be stale.
Follow-up
- What breaks first when traffic grows ten times?
- How does this behave when that dependency is down for an hour?
Design an Inventory Management System that handles product updates, stock tracking, and concurrency.
Design an Inventory Management System that handles product updates, stock tracking, and concurrency.
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- State the consistency you need, and where you are willing to be stale.
Follow-up
- What breaks first when traffic grows ten times?
- How does this behave when that dependency is down for an hour?
Demonstrate modular coding practices, including class design, interface usage, and clean API structures.
Demonstrate modular coding practices, including class design, interface usage, and clean API structures.
Approach
- Say who the caller is and what they do when the call fails halfway.
- Define the identity of a request so a retry cannot double-apply it.
- Separate accepted, pending, failed and confirmed; they are different facts.
- Design the error taxonomy before the success shape; callers branch on it.
Follow-up
- What happens if the caller retries after a timeout?
- How does a client discover it is on an old version of this contract?
Edge instances grow 400 MB per hour until the nightly restart
Edge API instances start at 700 MB resident and grow about 400 MB/hour; a nightly rolling restart has hidden it for weeks. Growth continues unchanged when request rate halves overnight, p99 degrades in the last hours before an instance is recycled, and heap used immediately after a forced full GC rises monotonically. The service holds no product state. Name the discriminating measurement that separates the plausible causes, give the most likely cause, and give the fix and how you would verify it.
Approach
- Separate resident memory from live heap first, because they fail differently. Resident size can grow from fragmentation, native buffers or thread stacks while the heap is flat; heap used after a full GC rising monotonically is the measurement that says objects are reachable and not being released. You already have it, so this is retention, not fragmentation, and that closes off half the candidate list.
- Use the rate's independence from traffic as the discriminator. Growth that continues at half the request rate rules out per-request objects that are merely slow to collect and points at a structure that grows with distinct values observed rather than with call volume. Write the candidates that have that property: a metrics registry keyed on a high-cardinality label, an unevicted cache, an interner, a per-key lock map.
- Take two heap snapshots an hour apart and diff by retained size, reading the dominator tree, not by allocation count or instance count. Expect one root holding a map with millions of entries, then follow the reference chain to the code that inserts and never removes. Allocation profilers point at churn, which is the wrong signal here.
- The candidate that fits this service is an observability label carrying an identifier, such as a request path recorded before templating so that /v1/resources/48213 becomes its own metric series. That grows with distinct ids seen, is independent of rate, and explains the late p99 degradation, since GC cost rises with the size of the live set.
Follow-up
- Post-GC heap is now flat but resident size still creeps. What are you looking at, and does it matter?
- How would you have detected this before an OOM, given the nightly restart masked the trend?
Built from the rounds and topics Meesho candidates report.
Prepare, practise & reflect
One practical outcome each day. Spend longer where you need it.
0 / 7 done01Map the Meesho loop
- Write out the reported sequence: Initial Screening, Technical Rounds, Machine Coding Assessment, Final Technical Evaluation.
- For each round, write one sentence on what it is judging, from the description above, and mark the one you are least ready for.
Deliverable: A one-page map of the 4 reported rounds, with the weakest marked.
02Work Data Structures & Algorithms (DSA)
- Spend the session on Data Structures & Algorithms (DSA), which Meesho candidates report being tested on.
- Write one worked example in Data Structures & Algorithms (DSA) and time yourself on it.
Deliverable: One timed worked example in Data Structures & Algorithms (DSA).
03Work Machine Coding (Hands-on Coding)
- Spend the session on Machine Coding (Hands-on Coding), which Meesho candidates report being tested on.
- Write one worked example in Machine Coding (Hands-on Coding) and time yourself on it.
Deliverable: One timed worked example in Machine Coding (Hands-on Coding).
04Work Algorithmic Efficiency / Time Complexity
- Spend the session on Algorithmic Efficiency / Time Complexity, which Meesho candidates report being tested on.
- Write one worked example in Algorithmic Efficiency / Time Complexity and time yourself on it.
Deliverable: One timed worked example in Algorithmic Efficiency / Time Complexity.
05Answer out loud: Data Structures & Algorithms (DSA)
- Answer aloud, timed: Solve problems involving arrays and sequences, such as optimizing the efficiency of processors arranged in a row.
- Answer aloud, timed: Implement solutions for challenging problems commonly found on competitive coding platforms.
Deliverable: Spoken answers to 2 reported Data Structures & Algorithms (DSA) question(s), under time.
06Answer out loud: Machine Coding & System Design
- Answer aloud, timed: Create a functional Stock Broker Application with support for order management and user portfolios.
- Answer aloud, timed: Design an Inventory Management System that handles product updates, stock tracking, and concurrency.
Deliverable: Spoken answers to 2 reported Machine Coding & System Design question(s), under time.
07Dry run for Meesho
- Run one full mock under time, then write down the two questions you most want to ask your interviewers.
Deliverable: A completed timed mock and two questions to ask.
Expand any day for tasks and deliverables. Your progress is saved on this device.
Behavioural rounds judge the decision you made and what it cost.
Argue against a design, lose, and commit anyway
Describe a design you argued against and lost. State the failure you predicted as a named mechanism, not a feeling about complexity: two services that would need one transaction, a projection with no rebuild path, a write path with no idempotency key. Say what evidence you brought, what the decision maker weighed instead, and what you did after the decision was made: what you instrumented, what you wrote down, and whether the prediction came true. Five minutes.
Approach
- State the prediction in falsifiable form up front: the mechanism, the condition that triggers it, and the observable outcome. A prediction that cannot be checked also cannot be credited to you later.
- Show the evidence you had at the time and label each piece honestly as measured, analogous, or intuition. Keeping the intuition is fine; disguising it as data is the thing that erodes your standing in the next argument.
- Represent the opposing case at full strength, including the constraint you did not control: a fixed date, a team boundary, or the fact that the decision was cheap to reverse and yours was not.
- Make disagree-and-commit concrete. Name the artefact you left behind so the prediction could be settled without you: the alert and its threshold, the counter on the dashboard, the decision note that recorded the trade-off and the condition that would revisit it.
Follow-up
- What threshold on that alert would have proved you right, and did anyone ever look at it?
- If the same proposal arrived tomorrow with the same deadline, would you argue it the same way?
Tell callers you do not own that their integration breaks
A field in a write endpoint's response must change shape. You own the endpoint; you do not own the four internal callers or the outbound webhook consumers who read it. Describe a deprecation you were responsible for: what you shipped first, how you established who was actually reading the field, the window you gave and what set its length, what you did about the consumer who never moved, and how you decided removal was safe. Name the signal you used, not the announcement you sent.
Approach
- Establish the reader set empirically rather than from a wiki of owners: per-field usage counters keyed by principal, or access logs attributed to a consumer. State the blind spot of whichever you pick, since a consumer that reads the field only on a monthly job will not appear in a week of logs.
- Ship additive first. Populate the new field alongside the old one so no reader is forced to move, which is also what keeps a rolling deploy safe, because old and new instances answer the same requests at the same time and a rollback must still find the old shape present.
- Set the window from the slowest legitimate consumer's release cadence, not from your calendar, and decide separately what to do for a consumer with no release process at all, such as an external webhook endpoint you can only email.
- Convert silence into evidence before you rely on it: a short, low-traffic removal window that makes a still-dependent consumer fail visibly and loudly while you are watching, rather than at three in the morning after you have moved on.
Follow-up
- How would you detect a consumer that reads the field only during a monthly export?
- One caller refuses to move and has a commercial relationship behind it. What changes in your plan and what does not?
Unblock an engineer without taking the keyboard
A teammate has spent two days on a job handler that occasionally writes duplicate rows. They are certain the queue is delivering twice by mistake. You suspect a lease expiring under a slow handler, so the job is running concurrently with itself. Describe how you have unblocked someone in this position: what you asked before offering a hypothesis, what you showed them rather than told them, and what you left them owning. Then say what you would do if their theory turned out to be the right one.
Approach
- Ask before diagnosing, and ask for things answerable from data they already have: the attempt count on the job rows that produced duplicates, the handler's observed duration against its lease expiry, and whether the duplicate rows share a natural key that a unique constraint could have caught.
- Teach the shape rather than the answer. A lease cannot distinguish a dead worker from a slow one, so a handler that outruns its lease is running twice by design, and deploys deliver the other half by killing handlers mid-run on every rollout. Both of their candidate theories produce identical duplicate rows, which is why the evidence has to come from timings rather than from argument.
- Hand over a checklist they execute: a natural key on every write the handler performs so the second copy collides rather than appends, the record of intent written before any external effect, a lease heartbeat while running, and the metric that shows it working.
- Keep ownership with them deliberately. Pair on the first write, then step back; if you finish it yourself you have closed one ticket and left the same person stuck on the next redelivery.
Follow-up
- How would you distinguish a genuine double-delivery from a lease expiry using only the data already stored?
- Their handler calls an external endpoint before recording that it did. What do you tell them to change first?
- 01
Describe a design you argued against and lost. State the failure you predicted as a named mechanism, not a feeling about complexity: two services that would need one transaction, a projection with no rebuild path, a write path with no idempotency key. Say what evidence you brought, what the decision maker weighed instead, and what you did after the decision was made: what you instrumented, what you wrote down, and whether the prediction came true. Five minutes.
- 02
A field in a write endpoint's response must change shape. You own the endpoint; you do not own the four internal callers or the outbound webhook consumers who read it. Describe a deprecation you were responsible for: what you shipped first, how you established who was actually reading the field, the window you gave and what set its length, what you did about the consumer who never moved, and how you decided removal was safe. Name the signal you used, not the announcement you sent.
- 03
A teammate has spent two days on a job handler that occasionally writes duplicate rows. They are certain the queue is delivering twice by mistake. You suspect a lease expiring under a slow handler, so the job is running concurrently with itself. Describe how you have unblocked someone in this position: what you asked before offering a hypothesis, what you showed them rather than told them, and what you left them owning. Then say what you would do if their theory turned out to be the right one.
How long does the interview process typically take?
The process duration varies, but candidates have reported that it can take anywhere from a few weeks to over two months, especially for senior roles like SDE-3.
Meesho Software Engineer candidate reports ↗Is the machine coding round language-specific?
No, you are generally free to choose the language you are most comfortable with, provided it is suitable for building a robust, object-oriented application.
Meesho Software Engineer candidate reports ↗What is the best way to prepare for the machine coding round?
Practice building small, self-contained applications (like a library management system or a parking lot) from scratch, focusing on clean interface design and object-oriented principles.
Meesho Software Engineer candidate reports ↗Does Meesho value "culture fit"?
Yes, Meesho looks for engineers who are collaborative, humble, and possess a high degree of ownership over their work. Do not spend too much time on a single question during the online assessment. If you are stuck, move to the next one and return later to ensure you complete the assessment within the time limit.
Meesho Software Engineer candidate reports ↗How many interview rounds does Meesho have for a Software Engineer, and what are they?
Meesho’s process starts with an initial screening, then moves into intensive technical rounds. After that, candidates take a specialized machine coding assessment, and the loop ends with a final technical evaluation to confirm skills are thoroughly assessed. Overall, it is a multi-stage, hands-on coding and architecture oriented process.
Meesho Software Engineer candidate reports ↗How difficult is it to get an offer at Meesho for Software Engineer roles?
That means you should expect competition and heavy technical evaluation rather than a light screening process.
Meesho Software Engineer candidate reports ↗What coding and system design topics does Meesho test for Software Engineer interviews?
The most tested areas include Data Structures and Algorithms, machine coding with hands-on coding, and algorithmic efficiency via time complexity. For machine coding and design-style questions, you may be asked to build an Inventory Management System or a Stock Broker Application, and you should be ready to discuss optimization versus naive solutions and trade-offs. Brute force approaches also appear as a comparison point in DSA.
Meesho Software Engineer candidate reports ↗What should I prioritize while preparing for Meesho Software Engineer machine coding questions?
Focus on producing functional, extensible code within a fixed timeframe, because the machine coding round evaluates how you architect an application from scratch. The preparation guidance also emphasizes modular coding practices and explaining trade-offs, like database schema and concurrency choices. Requirements handling matters, so ensure you meet all stated requirements before adding extra features.
Meesho Software Engineer candidate reports ↗What is the pay for a Software Engineer at Meesho?
The provided information does not include Meesho Software Engineer compensation figures, so pay cannot be stated from the available data. If you share the job level or location you are targeting, I can help you align it with whatever pay data you have.
Meesho Software Engineer candidate reports ↗Sources & methodology 3 sources ↗
No official company page is cited. Rounds and questions come from candidate reports and PracHub editorial material; each source shows the date it was read.
- 01Meesho Software Engineer candidate reports ↗
Company-reported rounds, questions and FAQ.
Candidate reports · Accessed 2026-09-22 - 02PracHub Software Engineer practice ↗
PracHub practice material, not company-reported.
PracHub page · Accessed 2026-09-22 - 03PracHub preparation framework ↗
PracHub preparation guidance.
PracHub page · Accessed 2026-09-22
Explore related engineering environments and compare the preparation focus.
Spotify Software Engineer Interview Guide
Timed practice for Spotify software engineer candidates who lose time to the clock: short problems taken end to end, then reviewed against a written rubric rather than a passing test run.
Discord Software Engineer Interview Guide
Database practice for Discord candidates: how an index changes a query plan, and which anomalies survive a given isolation level, since read committed still permits non-repeatable reads.
Booking.com Software Engineer Interview Questions & Guide 2026
Systems practice for Booking.com software engineer candidates, weighted toward travel and hospitality work: the load that actually arrives, the failure modes that matter there, and the invariants a partial outage must not break.
Zebra Technologies Software Engineer Interview Guide
What Zebra Technologies asks Software Engineer candidates, from reported rounds and questions.