Meesho Placement Papers 2026 — Complete Preparation Guide

Last Updated: March 2026

---

Company Overview

Meesho is India's largest social commerce platform enabling small businesses and individuals to start online stores via social media. It's a unicorn startup backed by top investors.

Key Facts:

• Founded: 2015
• Employees: 2000+
• India Offices: Bangalore (HQ)
• Valuation: $5+ billion

---

Eligibility Criteria

Criteria	Requirement
Degree	B.Tech/B.E, M.Tech, MCA
Branches	CSE, IT
Academic Score	70%+ throughout
Backlogs	No active backlogs

---

CTC & Compensation

Role	CTC (Fresher)
Software Engineer	12-20 LPA
Product Engineer	14-22 LPA
Data Scientist	15-25 LPA

---

Exam Pattern

Section	Questions	Duration
Aptitude	15	20 min
Technical MCQ	15	20 min
Coding	3	75 min

---

Aptitude Questions

Q1

A can do work in 20 days, B in 30 days. Together? Answer: 12 days

Q2

Speed ratio 3:4, time for same distance? Answer: 4:3

Q3

Ages ratio 3:5, sum is 48. Find difference? Answer: 12 years

Q4

CP:SP = 4:5. Profit %? Answer: 25%

Q5

Area of circle increased by 44%. Radius increased by? Answer: 20%

---

Technical Questions

1. Difference between SQL JOIN types?
2. Explain microservices vs monolith?
3. What is eventual consistency?
4. Rate limiting strategies?
5. Cache eviction policies?

---

Coding Questions (Python)

Q1: Group Anagrams

def group_anagrams(strs):
    from collections import defaultdict
    groups = defaultdict(list)
    for s in strs:
        key = ''.join(sorted(s))
        groups[key].append(s)
    return list(groups.values())

Q2: Valid Parentheses

def is_valid(s):
    stack = []
    mapping = {')': '(', '}': '{', ']': '['}
    for char in s:
        if char in mapping:
            top = stack.pop() if stack else '#'
            if mapping[char] != top:
                return False
        else:
            stack.append(char)
    return not stack

Q3: Longest Substring Without Repeating Characters

def length_of_longest(s):
    char_set = set()
    left = max_len = 0
    for right in range(len(s)):
        while s[right] in char_set:
            char_set.remove(s[left])
            left += 1
        char_set.add(s[right])
        max_len = max(max_len, right - left + 1)
    return max_len

---

Interview Tips

1. E-commerce Knowledge: Understand social commerce model
2. Startup Mindset: Show ownership and hustle
3. System Design: Basics of scalable systems
4. Data Structures: Strong DSA fundamentals
5. Problem Solving: Creative solutions to problems

---

FAQs

Q1: Is Meesho hiring freshers? Yes, campus + off-campus Q2: Tech stack? Go, Java, Python, React, AWS Q3: Interview focus? Coding + System Design + Culture fit

---

All the best for your Meesho placement!