Meesho interview experience Real time questions & tips from candidates to crack your interview

SDE - Intern

Meesho
upvote
share-icon
3 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Journey
I was looking for SDE roles when Meesho’s off-campus hiring post appeared on my LinkedIn feed. I applied through a Google Form linked in the post. Since I had previous internship experience at Paytm, that may have been a strong point that helped my resume get shortlisted.
Application story
I was an intern at Paytm during those days (SDET), but I wanted to move into development roles and was actively looking for SDE opportunities. One day, I came across a popup about Meesho's off-campus hiring for SDE Trainee roles. I applied through LinkedIn by filling out the form and later received the Online Assessment link.
Why selected/rejected for the role?
Maybe it was because I’m from a tier-3 college, or because I took 10 minutes extra in the system design round, or maybe the competition was just too tough. Honestly, I don’t know the real reason. The interviewer seemed happy after the round and even said, "You meet the required criteria we expect from a candidate after this round." I waited for two long days while others were receiving rejection emails, but I didn’t get any update. Then I called the HR after two days, and they told me my result would be declared by EOD or the next morning. Within 30 minutes of that call, I got the rejection email. But that’s it—luck plays a big role in everything.
Preparation
Duration: 3 months
Topics: System Design, LLD, DSA, OOPS, DBMS, MySQL.
Tip
Tip

Tip 1: Consistency is the key doesn't matter you are topper or average or below average.
Tip 2: Don't compare your progress with others.
Tip 3: If nothing good happens at last don't get demotivated, come back again.

Application process
Where: Linkedin
Eligibility: 7 CGPA, (Stipend: 1L per month)
Resume Tip
Resume tip

Tip 1: Highlight or prioritize the big achievement on your resume first.
Tip 2: Single page resume, add good project and coding profiles.

Interview rounds

01
Round
Hard
Online Coding Test
Duration165 minutes
Interview date22 Mar 2025
Coding problem3

There were 3 Hard DSA questions.

1. Task Scheduler

Moderate
35m average time
65% success
0/80
Asked in companies
UberFacebookOracle

You are given an array of CPU tasks, each labeled with a letter from A to Z, and a number n. Each CPU interval can be idle or allow the completion of one task. Tasks can be completed in any order, but there's a constraint: there has to be a gap of at least n intervals between two tasks with the same label.

Return the minimum number of CPU intervals required to complete all tasks.

Problem approach

Greedy + HashMap + Sorting was needed in this problem.

Try solving now

2. Contain Virus

Hard
45m average time
55% success
0/120
Asked in companies
AppleMeeshoMercer Mettl

Every night, the virus spreads to all neighboring cells in all four directions unless blocked by a wall. Resources are limited. Each day, you can install walls around only one region (i.e., the affected area (continuous block of infected cells) that threatens the most uninfected cells the following night). There will never be a tie.

Return the number of walls used to quarantine all the infected regions. If the world will become fully infected, return the number of walls used

Problem approach

Depth first search was needed in this, I wasn't able to solve it fully there were some test cases which I couldn't pass.

Try solving now

3. Longest Substring Without Repeating Characters

Moderate
30m average time
65% success
0/80
Asked in companies
FreshworksQualcommAdobe

Given a string s, find the length of the longest substring without duplicate characters.

Problem approach

Using HashMap and while loop and logic .This question can also be done through Stack.

Try solving now
02
Round
Medium
Video Call
Duration30 minutes
Interview date10 Apr 2025
Coding problem1

DSA Round: The interviewer emailed me a question in a Notepad file and asked me to solve it there. I opened an online compiler, and he said, okay open it and start solving the question.

1. Next Permutation

Moderate
15m average time
85% success
0/80
Asked in companies
OraclePharmEasyMeesho

A permutation of an array of integers is an arrangement of its members into a sequence or linear order.

For example, for arr = [1,2,3], the following are all the permutations of arr: [1,2,3], [1,3,2], [2, 1, 3], [2, 3, 1], [3,1,2], [3,2,1].
The next permutation of an array of integers is the next lexicographically greater permutation of its integer. More formally, if all the permutations of the array are sorted in one container according to their lexicographical order, then the next permutation of that array is the permutation that follows it in the sorted container. If such arrangement is not possible, the array must be rearranged as the lowest possible order (i.e., sorted in ascending order).

For example, the next permutation of arr = [1,2,3] is [1,3,2].
Similarly, the next permutation of arr = [2,3,1] is [3,1,2].
While the next permutation of arr = [3,2,1] is [1,2,3] because [3,2,1] does not have a lexicographical larger rearrangement.
Given an array of integers nums, find the next permutation of nums.

The replacement must be in place and use only constant extra memory.

Problem approach

Scan from right to left and find the first index i where nums[i] < nums[i + 1] — this is the "pivot".
If such i exists:
Find the smallest number greater than nums[i] to the right of it and swap them.
Reverse the portion after i to get the next smallest lexicographical order.
If i doesn't exist (i.e. the array is in descending order), just reverse the whole array.

Try solving now
03
Round
Medium
Video Call
Duration60 minutes
Interview date12 Apr 2025
Coding problem1

The interviewer asked my introduction and shared the link of system design questions.

1. System Design

4 functionalities I had to code from scratch within 60 mins:

  • Add a Product to Cart.
  • Remove a product from the Cart.
  • Create a coupon.
  • Pop up for the Expiry of the Coupon.
Problem approach

Tip 1: Understand the problem for 5-10 mins or take more.
Tip 2: Keep calm and start solving from the beginning.
Tip 3: Practise past year system design questions of Meesho or any other big product based company.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Meesho
1499 views
0 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 3 problems
Interviewed by Meesho
3783 views
0 comments
0 upvotes
company logo
SDE - Intern
3 rounds | 5 problems
Interviewed by Meesho
2007 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 5 problems
Interviewed by Meesho
6450 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - Intern
3 rounds | 6 problems
Interviewed by Amazon
15480 views
4 comments
0 upvotes
company logo
SDE - Intern
4 rounds | 7 problems
Interviewed by Microsoft
15338 views
1 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Amazon
10142 views
2 comments
0 upvotes