Meesho Interview – Tips and Tricks on how to Stand Out!

If you are also looking for jobs, join our Placement Guaranteed Course designed by top IITians and Senior developers & get a Job guarantee of CTC upto 25 LPA – /placement-guarantee-program/

Meesho, a leading social commerce platform in India, revolutionizes the way businesses are conducted by empowering individuals to start their online stores with zero investment. Founded in 2015, Meesho has grown exponentially, providing a seamless and profitable marketplace for small and medium-sized businesses.

Meesho Recruitment Process Overview

To secure a position at Meesho, candidates undergo a rigorous hiring process designed to evaluate their technical expertise and cultural fit. The process consists of four main rounds, each focusing on different aspects of the candidate’s skills and experience. Here’s a detailed breakdown of each round:

1. Screening Process
   • Duration: 45 minutes
   • Description: The initial screening is conducted via NextLevel, an AI-based screening app. Candidates are assessed on their knowledge of OOPS, Data Structures, Algorithms, DBMS, Networking, and Error Handling.
2. HackerRank Online Test
   • Duration: 105 minutes
   • Description: This round involves an online coding test administered through HackerRank. It focuses on problem-solving skills, algorithms, and data structures.
3. Technical Interview
   • Duration: 90 minutes
   • Description: In this virtual interview, candidates face a technical panel that evaluates their abilities in system design, coding, and debugging.

If you are also looking for jobs, join our Placement Guaranteed Course designed by top IITians and Senior developers & get a Job guarantee of CTC upto 25 LPA – /placement-guarantee-program/

Important DSA Questions

Arrays

1. Maximum Subarray Sum (Kadane’s Algorithm)
2. Merge Intervals
3. Trapping Rain Water
4. Maximum Product Subarray
5. Subarray Sum Equals K
6. Longest Consecutive Sequence
7. Product of Array Except Self
8. Rotate Image (Matrix)
9. Find Minimum in Rotated Sorted Array
10. 3Sum Closest

Strings

1. Longest Substring Without Repeating Characters
2. Longest Palindromic Substring
3. Regular Expression Matching
4. Minimum Window Substring
5. Edit Distance
6. Wildcard Matching
7. Palindrome Partitioning II
8. Word Search II
9. Scramble String
10. Repeated DNA Sequences

Linked Lists

1. Merge K Sorted Lists
2. Reverse Nodes in K-Group
3. Copy List with Random Pointer
4. LRU Cache Implementation
5. Remove Nth Node from End of List
6. Rotate List
7. Reorder List
8. Intersection of Two Linked Lists
9. Flatten a Multilevel Doubly Linked List
10. Add Two Numbers II

Trees and Graphs

1. Binary Tree Maximum Path Sum
2. Serialize and Deserialize Binary Tree
3. Lowest Common Ancestor of a Binary Tree
4. Redundant Connection II
5. Word Ladder II
6. Course Schedule II
7. Alien Dictionary
8. Critical Connections in a Network
9. Find Eventual Safe States
10. Maximum Flow in a Flow Network

Dynamic Programming

1. Longest Increasing Subsequence
2. Word Break II
3. Russian Doll Envelopes
4. Burst Balloons
5. Interleaving String
6. Minimum Difficulty of a Job Schedule
7. Palindrome Partitioning II
8. Maximal Rectangle
9. Largest Divisible Subset
10. Longest Palindromic Subsequence

Backtracking

1. N-Queens
2. Sudoku Solver
3. Word Search
4. Permutations II
5. Subsets II
6. Letter Combinations of a Phone Number
7. Combination Sum II
8. Palindrome Partitioning
9. Restore IP Addresses
10. Word Break

Heap and Priority Queue

1. Find Median from Data Stream
2. Merge K Sorted Lists
3. Sliding Window Maximum
4. Top K Frequent Elements
5. Kth Largest Element in an Array
6. Minimize Deviation in Array
7. Sort Characters By Frequency
8. Reorganize String
9. Task Scheduler
10. Smallest Range Covering Elements from K Lists

Greedy

1. Jump Game II
2. Minimum Number of Arrows to Burst Balloons
3. Partition Labels
4. Gas Station
5. Candy Distribution
6. Jump Game
7. Wildcard Matching
8. Find Minimum in Rotated Sorted Array II
9. Trapping Rain Water II
10. Minimum Cost to Connect Sticks

Bit Manipulation

1. Maximum XOR of Two Numbers in an Array
2. Single Number III
3. Find the Duplicate Number
4. Sum of Two Integers
5. Counting Bits
6. Reverse Bits
7. Power of Two
8. Bitwise AND of Numbers Range
9. Number of 1 Bits
10. Divide Two Integers

Hiring Manager Interview – Duration: 45 minutes

The final round involves a virtual interview with a technical panel, where candidates are assessed on problem-solving, system design, and cultural fit. This round also delves into past internships, college projects, and other relevant experiences.

Each round in the Meesho hiring process is designed to ensure that only the best candidates, who demonstrate both technical proficiency and alignment with Meesho’s culture, advance to the next stage. Successfully navigating through these stages can lead to an exciting career opportunity at one of India’s most innovative social commerce companies.

If you are also looking for jobs, join our Placement Guaranteed Course designed by top IITians and Senior developers & get a Job guarantee of CTC upto 25 LPA – /placement-guarantee-program/