Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Meesho Team. If you also belong to the team, you can get access from here

Meesho Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Meesho SDE-2 Interview Questions and Answers

Updated 11 Nov 2022

Meesho SDE-2 Interview Experiences

2 interviews found

SDE-2 Interview Questions & Answers

user image Anonymous

posted on 11 Nov 2022

I was interviewed in May 2022.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all Resume tips
Round 2 - One-on-one 

(1 Question)

  • Q1. Data Structures and Algorithms
Round 3 - Technical 

(1 Question)

  • Q1. Machine Coding round

Interview Preparation Tips

Interview preparation tips for other job seekers - Strong at Data Structures and Algorithms, and good system design knowledge

Rate your
company

🤫 100% anonymous

How was your last interview experience?

Share interview

SDE-2 Interview Questions & Answers

user image Anonymous

posted on 21 May 2022

I was interviewed in Jun 2021.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

- It was a face to face (virtually) round.
- Two questions one after one and you are expected to pass all the test cases.
- Question was Easy and Medium Easy. (tags: stack, array, bfs, dfs, array)

- Timing: Afternoon
- Interviewer: he was nice, as I was able to solve both question, he was very happy, and given me the feedback.

  • Q1. 

    Remove Consecutive Duplicates from String

    Given a string STR consisting of both lower and upper case characters, your task is to remove consecutive duplicate characters and return the newly formed string.

    ...
  • Ans. 

    The task is to remove consecutive duplicate characters from a given string and return the new string.

    • Iterate through the characters of the string

    • Compare each character with the next character

    • If they are the same, skip the next character

    • If they are different, append the current character to the new string

  • Answered by AI
  • Q2. 

    Number of Islands Problem Statement

    You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...

  • Ans. 

    The task is to find the number of islands present in a 2-dimensional array filled with ones and zeroes.

    • Iterate through each cell in the array

    • If the cell is land (1) and not visited, perform a depth-first search to find all connected land cells

    • Increment the count of islands for each connected component found

  • Answered by AI
Round 2 - Coding Test 

Round duration - 135 minutes
Round difficulty - Medium

Machine Coding.

Timing: Afternoon
The interviewer was answering my questions nicely.

Round 3 - HR 

Round duration - 60 minutes
Round difficulty - Medium

Hiring Manager.
Interviewer: Sr Engineering Manager.
Timing: evening.

The environment was cool.

Interview Preparation Tips

Eligibility criteria7+ CGPAMeesho interview preparation:Topics to prepare for the interview - Data Structures: - Arrays, Stack, Sliding Windows, Two Pointers, BFS, DFS, Dynamic Programming(Medium) OOPS & LLD:- Educative (Grokking the Object-Oriented Programming)- Design Patterns: Refactoring guru- Multithreading - Udemy (Java Multithreading, Concurrency & Performance Optimization)HLD:- Educative: grokking-the-system-design-interview- Book: System Design Interview – An Insider's Guide (Alex Xu)Database:- Relational database: articles blogsTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

Tip 1 : Stick to one coding platform either do it from geeks for geeks, coding ninja or leetcode. Never jump from one platform to other. Focus on Building the concept rather than solving it.
Tip 2 : Follow the Grooking the Object-Oriented Programming, and try to follow SOLID principle as much as you can. If possible take some MOCK interviews.
Tip 3 : Build your concept on Relational databases, you should be able to design the table structures and relationships.
Tip4: You should aware of your project and your contribution to it. Project Objective should be clear. You should know the tech stack used in project, and reason for choosing it.

Application resume tips for other job seekers

Tip 1 : Don't write too many paragraphs in the project description, It should be pointwise.
Tip 2 : Don't highlight too many skills, like HTML CSS kind of things.
Tip 3 : One page.
Tip 4 : If you are not a fresher, no need to mention school achievements.

Final outcome of the interviewSelected

Skills evaluated in this interview

SDE-2 Interview Questions Asked at Other Companies

asked in Walmart
Q1. Maximum Frequency Number Problem Statement Given an array of inte ... read more
asked in Atlassian
Q2. K Most Frequent Words Problem Statement Given an array of N non-e ... read more
Q3. Reverse String Operations Problem Statement You are provided with ... read more
asked in KhataBook
Q4. Alien Dictionary Problem Statement Ninja is mastering an unusual ... read more
asked in Zoho
Q5. Make Palindrome Problem Statement You are provided with a string ... read more

Interview questions from similar companies

I was interviewed before Sep 2020.

Round 1 - Video Call 

(1 Question)

Round duration - 1hour
Round difficulty - Hard

  • Q1. 

    Snake and Ladder Problem Statement

    Given a 'Snake and Ladder' board with N rows and N columns, where positions are numbered from 1 to (N*N) starting from the bottom left, alternating direction each row, f...

  • Ans. 

    Find the minimum number of dice throws required to reach the last cell on a 'Snake and Ladder' board.

    • Use Breadth First Search (BFS) algorithm to find the shortest path from start to end cell.

    • Keep track of visited cells and the number of dice throws required to reach each cell.

    • Consider the presence of snakes and ladders while calculating the next possible moves.

    • Return the minimum number of dice throws to reach the last

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 1hour
Round difficulty - Hard

  • Q1.  Stack using queue

    Mvvm architecture

  • Ans. 

    Implement a stack using a queue in MVVM architecture

    • Use two queues to simulate a stack

    • Push operation: Enqueue the element to queue 1

    • Pop operation: Dequeue all elements from queue 1 to queue 2, dequeue the last element from queue 2 (which is the top of the stack)

    • Ensure proper synchronization between the two queues

    • Example: Push(1), Push(2), Pop() should return 2

  • Answered by AI
Round 3 - HR 

Round duration - 1hour
Round difficulty - Easy

Interview Preparation Tips

Eligibility criteriaNo year gapBig Basket interview preparation:Topics to prepare for the interview - Core Java, android topics , Hacker coding test , ecommerce domain knowledge, data structure , algorithmsTime required to prepare for the interview - 1 monthInterview preparation tips for other job seekers

Tip 1 : be confident
Tip 2 : always say truth about your experience
Tip 3 : don't be nervous

Application resume tips for other job seekers

Tip 1 : mentioned project u worked on 
Tip 2 : technical skills

Final outcome of the interviewSelected

Skills evaluated in this interview

SDE-2 Interview Questions & Answers

Blinkit user image Anonymous

posted on 20 May 2022

I was interviewed in May 2022.

Round 1 - Face to Face 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Medium

Timing was around 11 am
Environment was great, it intrigued me to join Blinkit.

  • Q1. 

    Pair Sum Problem Statement

    You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.

    Note:
    ...
  • Ans. 

    Find pairs of elements in an array that sum up to a given value, sorted in a specific order.

    • Sort the array in non-decreasing order.

    • Use two pointers approach to find pairs with sum equal to 'S'.

    • Return pairs in sorted order based on first value, with smaller second value coming first.

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

Timing 11 am
Interviewer had good knowledge

  • Q1. Can you explain the activity lifecycle in Android development?
  • Ans. 

    Activity lifecycle in Android development involves various states like onCreate, onStart, onResume, onPause, onStop, onDestroy.

    • Activity is created with onCreate() method

    • Activity becomes visible with onStart() and onResume() methods

    • Activity goes into background with onPause() method

    • Activity is stopped with onStop() method

    • Activity is destroyed with onDestroy() method

  • Answered by AI
  • Q2. Can you explain the fragment lifecycle in Android development?
  • Ans. 

    Fragment lifecycle in Android involves various states like created, started, resumed, paused, stopped, and destroyed.

    • Fragments are created using the onCreateView() method.

    • Fragments go through states like created, started, resumed, paused, stopped, and destroyed based on user interactions and system events.

    • Fragment lifecycle methods include onCreate(), onStart(), onResume(), onPause(), onStop(), and onDestroy().

  • Answered by AI
  • Q3. Can you explain the MVVM pattern?
  • Ans. 

    MVVM is a design pattern that separates the user interface from the business logic and data model.

    • MVVM stands for Model-View-ViewModel

    • Model represents the data and business logic

    • View represents the UI components

    • ViewModel acts as an intermediary between the Model and View, handling user input and updating the Model

    • MVVM promotes separation of concerns and easier unit testing

  • Answered by AI
Round 3 - Face to Face 

Round duration - 30 Minutes
Round difficulty - Easy

This round is cultural fit round

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 2 in BangaloreEligibility criteriaNoGrofers interview preparation:Topics to prepare for the interview - Data structures, Threading and synchronisation, Kotlin vs Java, Activities lifecycle, Fragment lifecycle, Android services, Reduce APK size, Create analytics libraryTime required to prepare for the interview - 1 monthInterview preparation tips for other job seekers

Tip 1 : Prepare easy/medium level data structures questions in leetcode. Solve atleast 50 questions of multiple types like strings, arrays, tree, linked list, graph
Tip 2 : Go through Android basic questions like lifecycle, live data, MVC/mvp/ mvvm pattern, retrofit, data binding
Tip 3 : Atleast solve 5 design questions like how to build Instagram, analytics library, crashlytics

Application resume tips for other job seekers

Tip 1 : be concise 
Tip 2 : write only those keywords which you have in depth knowledge

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in May 2021.

Round 1 - Coding Test 

Round duration - 120 minutes
Round difficulty - Medium

it was morning 10AM-12
friendly environment given by the interviewer
It was machine coding round, the problem statement was to create a online food ordering system with various features.
interviewer was good and supportive

Round 2 - Video Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

timing noon 3-4Pm
good interviewer 
interviwer was giving hints if required and all

  • Q1. 

    Problem: Sort an Array of 0s, 1s, and 2s

    Given an array/list ARR consisting of integers where each element is either 0, 1, or 2, your task is to sort this array in increasing order.

    Input:

    The input sta...
  • Ans. 

    Sort an array of 0s, 1s, and 2s in increasing order.

    • Use a three-pointer approach to sort the array in a single pass.

    • Initialize three pointers for 0, 1, and 2 values and iterate through the array.

    • Swap elements based on the values encountered to achieve the sorted array.

    • Example: Input array [0, 2, 1, 1] should be sorted as [0, 1, 1, 2].

  • Answered by AI
  • Q2. 

    Maximum Path Sum Problem Statement

    You are given an n-ary tree consisting of 'N' nodes. Your task is to determine the maximum sum of the path from the root to any leaf node.

    Example:

    Input:
    For the giv...
  • Ans. 

    Find the maximum sum of the path from the root to any leaf node in an n-ary tree.

    • Traverse the tree from root to leaf nodes, keeping track of the sum along the path.

    • At each node, calculate the sum of the path from the root to that node and update the maximum sum found so far.

    • Consider using depth-first search (DFS) to traverse the tree efficiently.

    • Handle cases where nodes are absent (-1) by appropriately updating the pat...

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 90 Minutes
Round difficulty - Easy

evening 4-5:30PM
interviewer was good
very supportive and giving hints

  • Q1. Design a system for BookMyShow to allow users to book movie tickets.
  • Ans. 

    Design a system for BookMyShow to allow users to book movie tickets.

    • Create a user-friendly website and mobile app for users to browse movies and showtimes.

    • Implement a secure payment gateway for users to purchase tickets online.

    • Develop a database to store movie information, showtimes, and user bookings.

    • Include features like seat selection, ticket confirmation, and booking history for users.

    • Integrate with cinema partners

  • Answered by AI
Round 4 - HR 

(2 Questions)

Round duration - 40 Minutes
Round difficulty - Easy

4-5 PM
Interviewer was good

  • Q1. Why should we hire you?
  • Q2. Why are you considering a switch in your job?

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 2 in BangaloreEligibility criteriano criteriaFlipkart interview preparation:Topics to prepare for the interview - Data Structures, DBMS, OOPS, System Design, Algorithms, Dynamic ProgrammingTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Practice Atleast 200 Questions
Tip 2 : Practice company specific interview question
Tip 3 : Prepare resume nicely

Application resume tips for other job seekers

Tip 1 : Prepare resume very nicely.
Tip 2 : don't mention any tech stack you are confident of.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
No response

I applied via LinkedIn and was interviewed in Apr 2024. There was 1 interview round.

Round 1 - Coding Test 

That is machine coding round, where one problem will be given and you have to implement proper functionality with correct test cases.

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
-
Result
Not Selected

I applied via Referral and was interviewed in Jan 2023. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all Resume tips
Round 2 - Assignment 

This was a machine coding round in which we have to implement an online cab booking service.

Round 3 - Coding Test 

Standard problem solving round consists of two questions on tree and dp.

Interview Preparation Tips

Interview preparation tips for other job seekers - 1.Do not take input as given,focus on implementing the services first.Take comma separated input also.
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Recruitment Consulltant and was interviewed in Aug 2022. There were 5 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all Resume tips
Round 2 - Coding Test 

2 Coding questions both easy-medium level.
1. Based on the Sliding Window
2. Graph Question

Round 3 - Assignment 

A simple feed platform, which supports some basic functionality. The main point of this round was to see how well a candidate architect the application.

Round 4 - One-on-one 

(4 Questions)

  • Q1. Basic discussion around the project & past experience.
  • Q2. Design a 2/3rd Winning game.
  • Ans. 

    Design a 2/3rd Winning game.

    • The game should have a clear win condition

    • The win condition should be achievable in 2/3rd of the total game time

    • The game should have a balanced difficulty level

    • The game should have a clear feedback system for the player

    • Examples: Chess, Tic Tac Toe, Connect Four

  • Answered by AI
  • Q3. Discussion around how would you scale a application.
  • Q4. NoSQL vs SQL difference
  • Ans. 

    NoSQL is non-relational and schema-less while SQL is relational and has a fixed schema.

    • NoSQL databases are horizontally scalable and can handle large amounts of unstructured data.

    • SQL databases are vertically scalable and are better suited for structured data with complex relationships.

    • NoSQL databases are often used in web applications, while SQL databases are commonly used in enterprise applications.

    • Examples of NoSQL d...

  • Answered by AI
Round 5 - One-on-one 

(3 Questions)

  • Q1. Hiring Manager round
  • Q2. Basic discussions around past work, past processes, what are your future aspirations etc.
  • Q3. This round was mainly for seeing the culture fitment of a candidate.

Interview Preparation Tips

Topics to prepare for Flipkart SDE-2 interview:
  • Data Structures
  • Algorithms
  • System Design
  • Microservices
  • Java
  • Spring Boot
Interview preparation tips for other job seekers - Prepare well for Data structures & Algorithms.
Along with that, you should be well-versed in System design concepts.

Skills evaluated in this interview

I was interviewed before Jan 2021.

Round 1 - Face to Face 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This was a typical DS/Algo where I was asked to solve two questions related to Binary Trees and write the pseudo code for both of them followed by some theoretical questions related to Operating Systems.

  • Q1. 

    K-th Largest Number in a BST

    Given a binary search tree (BST) consisting of integers and containing 'N' nodes, your task is to find and return the K-th largest element in this BST.

    If there is no K-th la...

  • Ans. 

    Find the K-th largest element in a BST.

    • Perform reverse in-order traversal of the BST to find the K-th largest element.

    • Keep track of the count of visited nodes to determine the K-th largest element.

    • Return -1 if there is no K-th largest element in the BST.

  • Answered by AI
  • Q2. 

    Is Height Balanced Binary Tree Problem Statement

    Determine if the given binary tree is height-balanced. A tree is considered height-balanced when:

    1. The left subtree is balanced.
    2. The right subtree is bala...
  • Ans. 

    Determine if a given binary tree is height-balanced by checking if left and right subtrees are balanced and their height difference is at most 1.

    • Check if the left subtree is balanced

    • Check if the right subtree is balanced

    • Calculate the height difference between the left and right subtrees

    • Return 'True' if all conditions are met, otherwise return 'False'

  • Answered by AI
  • Q3. Can you explain the concepts of Zombie Process and Orphan Process in operating systems?
  • Ans. 

    Zombie process is a terminated process that has completed execution but still has an entry in the process table. Orphan process is a process whose parent process has terminated.

    • Zombie process is created when a child process completes execution but its parent process has not yet read its exit status.

    • Zombie processes consume system resources and should be cleaned up by the parent process using wait() system call.

    • Orphan p...

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This was also a Data Structures and Algorithm round where I was asked to solve 3 medium to hard level problems along with their pseudo code within 60 minutes .

  • Q1. 

    Longest Substring Without Repeating Characters Problem Statement

    Given a string S of length L, determine the length of the longest substring that contains no repeating characters.

    Example:

    Input:
    "abac...
  • Ans. 

    Find the length of the longest substring without repeating characters in a given string.

    • Use a sliding window approach to keep track of the longest substring without repeating characters.

    • Use a hashmap to store the index of each character in the string.

    • Update the start index of the window when a repeating character is found.

    • Calculate the maximum length of the window as you iterate through the string.

    • Return the maximum le

  • Answered by AI
  • Q2. 

    Problem: Search In Rotated Sorted Array

    Given a sorted array that has been rotated clockwise by an unknown amount, you need to answer Q queries. Each query is represented by an integer Q[i], and you must ...

  • Ans. 

    Search for integers in a rotated sorted array efficiently.

    • Use binary search to efficiently search for integers in the rotated sorted array.

    • Handle the rotation of the array while performing binary search.

    • Return the index of the integer if found, else return -1.

  • Answered by AI
  • Q3. 

    Count Subarrays with Sum Divisible by K

    Given an array ARR and an integer K, your task is to count all subarrays whose sum is divisible by the given integer K.

    Input:

    The first line of input contains an...
  • Ans. 

    Count subarrays with sum divisible by K in an array.

    • Iterate through the array and keep track of the prefix sum modulo K.

    • Use a hashmap to store the frequency of each prefix sum modulo K.

    • For each prefix sum, increment the count by the frequency of (prefix sum - K) modulo K.

    • Handle the case when prefix sum itself is divisible by K.

    • Return the total count of subarrays with sum divisible by K.

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

In this round , I was asked to code a simple question related to BST . After that I was asked the internal implementation of a Hash Map where I was supposed to design a Hash Map using any of the Hashing Algorithms that I know . This was preety challenging for me but I got to learn so much from it.

  • Q1. 

    Ceil Value from BST Problem Statement

    Given a Binary Search Tree (BST) and an integer, write a function to return the ceil value of a particular key in the BST.

    The ceil of an integer is defined as the s...

  • Ans. 

    Ceil value of a key in a Binary Search Tree (BST) is found by returning the smallest integer greater than or equal to the given number.

    • Traverse the BST to find the closest value greater than or equal to the key.

    • Compare the key with the current node value and update the ceil value accordingly.

    • Recursively move to the left or right subtree based on the comparison.

    • Return the ceil value once the traversal is complete.

  • Answered by AI
  • Q2. 

    Design a Constant Time Data Structure

    Create a data structure that maintains mappings between keys and values, supporting the following operations in constant time:

    1. INSERT(key, value): Add or update t...
  • Ans. 

    Design a constant time data structure to maintain mappings between keys and values with various operations.

    • Use a hash table to achieve constant time complexity for INSERT, DELETE, SEARCH, and GET operations.

    • Keep track of the number of key-value pairs for GET_SIZE operation.

    • Check if the hash table is empty for IS_EMPTY operation.

    • Return true or false for SEARCH operation based on key existence.

    • Return the value associated...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAFlipkart interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Jan 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 Minutes
Round difficulty - Hard

I found the online coding round of Flipkart to be quite difficult based on the constraints of the problem and their time limits. I coded the first problem quite easily but on the second and the third problem , my code could only pass a few test cases and gave TLE for most of them. Both the questions required very efficient solution and the last 5 to 10 Test Cases carried more weight than the rest so I didn't get through this round.

  • Q1. 

    Print the Kth Digit

    Given three non-negative integers N, M, and K, compute the Kth digit from the right in the number obtained from N raised to the power M (i.e., N ^ M).

    Input:

    The first line contains ...
  • Ans. 

    The task is to find the Kth digit from the right in the number obtained from N raised to the power M.

    • Iterate through the digits of N^M from right to left

    • Keep track of the position of the current digit

    • Return the digit at position K from the right

  • Answered by AI
  • Q2. 

    The Skyline Problem

    Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette when viewed from a distance. Each building is ...

  • Ans. 

    Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette.

    • Iterate through the buildings and create a list of critical points (x, y) where the height changes.

    • Sort the critical points based on x-coordinate and process them to form the skyline.

    • Merge consecutive horizontal segments of equal height into one to ensure no duplicates.

    • Return the fin...

  • Answered by AI
  • Q3. 

    Longest Palindromic Substring Problem Statement

    You are provided with a string STR of length N. The goal is to identify the longest palindromic substring within this string. In cases where multiple palind...

  • Ans. 

    Identify the longest palindromic substring in a given string.

    • Iterate through the string and expand around each character to find palindromes

    • Keep track of the longest palindrome found

    • Return the longest palindrome with the smallest start index

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAFlipkart interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewRejected

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

Meesho Interview FAQs

How many rounds are there in Meesho SDE-2 interview?
Meesho interview process usually has 3 rounds. The most common rounds in the Meesho interview process are Resume Shortlist, One-on-one Round and Technical.
What are the top questions asked in Meesho SDE-2 interview?

Some of the top questions asked at the Meesho SDE-2 interview -

  1. Machine Coding ro...read more
  2. Data Structures and Algorit...read more

Recently Viewed

PHOTOS

InsuranceDekho

3 office photos

LIST OF COMPANIES

Credit Bajaar

Overview

INTERVIEWS

NIIT

No Interviews

SALARIES

NIIT

SALARIES

uFaber

REVIEWS

NIIT

No Reviews

SALARIES

NIIT

JOBS

NIIT

No Jobs

REVIEWS

NIIT

No Reviews

REVIEWS

NIIT

No Reviews

Tell us how to improve this page.

Anonymously discuss salaries, work culture, and many more

Get Ambitionbox App

SDE-2 Interview Questions from Similar Companies

Flipkart SDE-2 Interview Questions
4.0
 • 5 Interviews
View all
Meesho SDE-2 Salary
based on 10 salaries
₹26 L/yr - ₹47 L/yr
At par with the average SDE-2 Salary in India
View more details

Meesho SDE-2 Reviews and Ratings

based on 7 reviews

4.5/5

Rating in categories

4.5

Skill development

4.1

Work-life balance

4.7

Salary

3.7

Job security

4.5

Company culture

4.1

Promotions

4.5

Work satisfaction

Explore 7 Reviews and Ratings
Key Account Manager
745 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

City Manager
205 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Business Analyst
190 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Business Development Manager
171 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Team Lead
166 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Meesho with

Amazon

4.1
Compare

Flipkart

4.0
Compare

Myntra

4.0
Compare

GlowRoad

4.2
Compare
Did you find this page helpful?
Yes No
write
Share an Interview