Meesho Placement Papers 2024

Overview

This page collects Meesho placement papers from 2024 with previous-year questions, solutions, and the 2024 exam pattern. It is useful when you want real drive history: what the OA looked like, which question types repeated, and how solutions were approached. Work through the papers below to build speed and accuracy, then compare against newer 2025 material so your prep matches both established Meesho patterns and the latest shifts.

2024 Pattern

The 2024 Meesho placement process emphasized DSA mastery and e-commerce system design. Online assessment included 2-3 coding problems focusing on arrays, trees, graphs, and dynamic programming.

Meesho Online Assessment 2024 pattern

Section	Questions	Time	Difficulty	Focus Areas
Coding Problems	2-3	60-90 min	Medium-Hard	Arrays, trees, graphs, DP

Total: 2-3 problems, 60-90 minutes

Platform: HackerRank or similar
Languages Allowed: Python, Java, JavaScript
Success Rate: ~15-20% cleared OA and advanced to interviews

Meesho Placement Papers 2024 - actual questions & solutions

This section contains practice questions styled on Meesho placement papers 2024 (previous-year pattern), with worked solutions. Use them as timed sectional drills - from student reports drives vary by college and role, so treat this as a high-signal practice bank, not an official paper dump.

Question 1: merge two sorted lists

Show solution

Problem Statement: Merge two sorted linked lists and return a new sorted list.

Example:

Input: 1→2→4 , 1→3→4
Output: 1→1→2→3→4→4

Solution (Java):

public ListNode mergeTwoLists(ListNode a, ListNode b) {
    ListNode dummy = new ListNode(0), cur = dummy;
    while (a != null && b != null) {
        if (a.val <= b.val) { cur.next = a; a = a.next; }
        else { cur.next = b; b = b.next; }
        cur = cur.next;
    }
    cur.next = (a != null) ? a : b;
    return dummy.next;
}

Time Complexity: O(n + m)
Space Complexity: O(1)

Question 2: first non-repeating character

Show solution

Problem Statement: Return the first non-repeating character in a string, or ‘_’ if none.

Example:

Input: "swiss"
Output: 'w'

Solution (Java):

public char firstUnique(String s) {
    int[] freq = new int[256];
    for (char c : s.toCharArray()) freq[c]++;
    for (char c : s.toCharArray()) if (freq[c] == 1) return c;
    return '_';
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 3: maximum subarray sum

Show solution

Problem Statement: Find the contiguous subarray with the largest sum.

Example:

Input: [-2, 1, -3, 4, -1, 2, 1, -5, 4]
Output: 6  // [4, -1, 2, 1]

Solution (Java):

public int maxSubArray(int[] nums) {
    int best = nums[0], cur = nums[0];
    for (int i = 1; i < nums.length; i++) {
        cur = Math.max(nums[i], cur + nums[i]);
        best = Math.max(best, cur);
    }
    return best;
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 4: detect cycle in linked list

Show solution

Problem Statement: Return true if the linked list has a cycle.

Example:

Input: 3→2→0→-4→(back to 2)
Output: true

Solution (Java):

public boolean hasCycle(ListNode head) {
    ListNode slow = head, fast = head;
    while (fast != null && fast.next != null) {
        slow = slow.next;
        fast = fast.next.next;
        if (slow == fast) return true;
    }
    return false;
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 5: check palindrome

Show solution

Problem Statement: Return true if the string reads the same forward and backward (ignore case).

Example:

Input: "Level"
Output: true

Solution (Java):

public boolean isPalindrome(String s) {
    s = s.toLowerCase();
    int i = 0, j = s.length() - 1;
    while (i < j) {
        if (s.charAt(i++) != s.charAt(j--)) return false;
    }
    return true;
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 6: climbing stairs

Show solution

Problem Statement: You can climb 1 or 2 steps. How many distinct ways to climb n stairs?

Example:

Input: n = 4
Output: 5

Solution (Java):

public int climbStairs(int n) {
    if (n <= 2) return n;
    int a = 1, b = 2;
    for (int i = 3; i <= n; i++) {
        int c = a + b; a = b; b = c;
    }
    return b;
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 7: two sum

Show solution

Problem Statement: Given an array of integers and a target, return indices of two numbers that add up to target.

Example:

Input: nums = [2, 7, 11, 15], target = 9
Output: [0, 1]

Solution (Java):

public int[] twoSum(int[] nums, int target) {
    Map<Integer, Integer> map = new HashMap<>();
    for (int i = 0; i < nums.length; i++) {
        int need = target - nums[i];
        if (map.containsKey(need)) return new int[]{map.get(need), i};
        map.put(nums[i], i);
    }
    return new int[]{};
}

Time Complexity: O(n)
Space Complexity: O(n)

Question 8

Q8: Worst-case time complexity of quicksort is?

Solution:

Unbalanced partitions (already sorted with bad pivot) → O(n²).

Answer: O(n²)

Question 9

Q9: Which normal form removes transitive dependency?

Solution:

1NF: atomic values. 2NF: no partial dependency. 3NF: no transitive dependency.

Answer: 3NF

Question 10

Q10: In OOP, hiding internal details and showing only essential features is called?

Solution:

This is the definition of Encapsulation (often paired with abstraction in interviews).

Answer: Encapsulation

Question 11

Q11: Virtual memory is typically implemented using?

Solution:

OS uses demand paging (and sometimes segmentation) to implement virtual memory.

Answer: Demand paging

Key insights from 2024 Meesho Online Assessment

1. Coding Section is Critical: Must solve 2-3 coding problems correctly to advance
2. DSA Focus: Strong emphasis on arrays, strings, trees, graphs, and dynamic programming
3. Time Management: 2-3 problems in 60-90 minutes requires excellent speed and accuracy
4. E-commerce Focus: Problems often relate to e-commerce systems, product recommendations, social commerce
5. System Design: Asked for SDE-1/2 roles, e-commerce system design for social commerce roles
6. Success Rate: Only 15-20% cleared OA and advanced to interviews
7. Platform: HackerRank or Meesho’s internal platform
8. Focus Areas: Arrays, trees, graphs, dynamic programming, e-commerce systems, social commerce

Meesho 2024 interview experiences

Based on candidate experiences from 2024 Meesho interviews:

2024 Interview Process:

1. Online Assessment (60-90 minutes): 2-3 coding problems
2. Technical Phone Screen (45-60 minutes): Coding problems, algorithm discussions, e-commerce concepts
3. Onsite Interviews (4-5 rounds, 45-60 minutes each):

• Coding rounds (2-3): Algorithms, data structures, problem-solving
• System Design rounds: E-commerce platforms, social commerce systems, product recommendations, scalability
• Behavioral rounds: Problem-solving approach, innovation, impact

Common 2024 Interview Topics:

• Coding: Arrays, strings, trees, graphs, dynamic programming, e-commerce algorithms
• System Design: E-commerce platforms, social commerce systems, product recommendations, scalability
• Behavioral: Problem-solving, innovation, teamwork, impact
• Meesho Technologies: Social commerce, e-commerce platforms, product recommendations, social sharing

2024 Interview Questions Examples:

• Product of Array Except Self
• Design Meesho’s product recommendation system (System Design)
• Design Meesho’s social commerce platform (System Design)
• E-commerce and social commerce algorithms

Success Tips:

• Strong coding performance is essential - solve problems optimally
• Understand e-commerce and social commerce concepts
• Practice system design for e-commerce platforms and social commerce systems
• Prepare examples demonstrating innovation and problem-solving
• Learn Meesho’s products and social commerce model
• Practice explaining your thought process clearly

For detailed interview experiences, visit Meesho Interview Experience page.

Preparation tips for Meesho 2024 pattern

1. Master Coding Fundamentals: Focus on solving 2-3 coding problems correctly - arrays, trees, graphs, DP
2. E-commerce Knowledge: Strong understanding of e-commerce systems, social commerce, product recommendations
3. Practice Previous Year Papers: Solve Meesho OA papers from 2020-2024 to understand patterns
4. Time Management: Practice completing 2-3 coding problems in 60-90 minutes
5. LeetCode Practice: Solve 200+ LeetCode problems focusing on arrays, strings, trees, graphs (medium-hard difficulty)
6. E-commerce Focus: Practice problems related to e-commerce systems and social commerce
7. System Design Mastery: Learn e-commerce platform design, social commerce systems, product recommendations
8. Meesho Technologies: Learn social commerce, e-commerce platforms, product recommendations, social sharing
9. Behavioral Preparation: Prepare examples using STAR format - innovation, problem-solving, impact
10. Mock Tests: Take timed practice tests to improve speed and accuracy

Comments & Suggestions

Related resources

2025 papers→

Coding questions→

Interview experience→

Preparation guide→

Meesho hub→

Similar companies

Flipkart · Zomato · Swiggy · Paytm · Phonepe · Razorpay