Meesho Syllabus and Test Pattern 2025

Meesho Hiring Pattern 2025

Round 1: Resume Screening

Round 2: HackerEarth Online Test

Online coding assessment will be conducted on the HackerEarth platform.

• Duration: 105 minutes
• Topics Covered:
  • Coding skills (Data Structures & Algorithms)
  • Debugging proficiency

Candidates are tested on their ability to write efficient code and fix errors in existing code snippets.

Round 3: Technical Interview

Virtual interview with the technical panel, where in depth knowledge of computer science concepts is assessed.

• Duration: 90 minutes
• Topic:
  • System Design
  • Coding & Debugging

Candidates should expect DSA questions, problem solving tasks, and discussions on past projects.

Round 4: Hiring Manager Interview

The final virtual interview with the hiring manager focuses on both technical and behavioral aspects.

• Duration: 45 minutes
• Topic:
  • Problem Solving
  • System Design
  • Cultural Fitment

This round plays a key role in final selection, ensuring that the candidate not only possesses the required technical expertise but also fits well within the company's culture.

Meesho Placement Papers

Meesho Coding Test Pattern 2025

HackerEarth Online Test is a crucial step in the Meesho hiring process, designed to evaluate a candidate’s coding skills and debugging ability.

Test duration is 105 minutes and consists of coding and debugging challenges of varying difficulty levels.

Topics Covered (Basic to Advanced)

Coding (Data Structures & Algorithms - DSA)

Candidates must solve algorithmic problems by writing efficient and optimized code.

Basic Topics:

1. Arrays & Strings: Sorting, Searching, Two Pointers, Sliding Window
2. Mathematics: Prime Numbers, GCD/LCM, Modulo Arithmetic
3. Recursion & Backtracking: Factorial, Fibonacci & Permutations

Intermediate Topics:

1. Linked Lists: Reversing a Linked List & Merging Sorted Lists
2. Stack & Queue: Next Greater Element & LRU Cache
3. Hashing & HashMaps: Frequency Count & Anagram Problems
4. Binary Search & Divide and Conquer: Search in Rotated Sorted Array

Advanced Topics:

1. Trees & Graphs: BFS, DFS & Shortest Path Algorithms (Dijkstra, Floyd-Warshall
2. Dynamic Programming: Knapsack & Longest Common Subsequence (LCS)
3. Trie & Segment Tree: Auto complete Feature & Range Queries.

Practice Meesho Coding Questions

Meesho Code Debugging Pattern 2025

Debugging Challenges

Candidates are given buggy code and must analyze, fix, and optimize it. This tests their analytical thinking and debugging efficiency.

Debugging Topics Covered:

1. Identifying and fixing syntax errors.
2. Logical errors leading to incorrect outputs.
3. Optimizing inefficient code for better performance.
4. Memory leaks and handling edge cases.