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

Meesho Sales & Marketing Interview Questions and Answers

Updated 7 Jul 2022

Meesho Sales & Marketing Interview Experiences

1 interview found

I applied via Company Website and was interviewed in Jan 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 tips
Round 2 - Group Discussion 

Marketing and selling

Round 3 - Technical 

(1 Question)

  • Q1. Technically service online services fastest and best discount
Round 4 - HR 

(1 Question)

  • Q1. Hr advised and discuss the product value
Round 5 - Assignment 

Best policy in the product assistant manager

Interview Preparation Tips

Interview preparation tips for other job seekers - I think product quality best is best natural and no harm Price is best discount on product and customer like the product and useful that's all thank you

Interview questions from similar companies

I applied via Recruitment Consulltant and was interviewed before Jul 2021. There were 4 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 tips
Round 2 - Assignment 

The second round is qualified to documentation round

Round 3 - Aptitude Test 

Open mind test, attitude test

Round 4 - Case Study 

How much salary do you expectation now?

Interview Preparation Tips

Topics to prepare for Swiggy Sales & Marketing interview:
  • Open mind
  • Good attitude
Interview preparation tips for other job seekers - Network marketing is a good company. It hold and then give opportunity for your life. I like To network marketing.

Interview Questionnaire 

1 Question

  • Q1. What is secondary sale
  • Ans. 

    Secondary sale refers to the sale of a product by a customer who has already purchased it.

    • It is a sale that occurs after the initial sale of a product

    • It is often driven by customer satisfaction and loyalty

    • Examples include repeat purchases, referrals, and upgrades

    • It is an important metric for measuring customer lifetime value

  • Answered by AI

I applied via Approached by Company and was interviewed in Oct 2022. There was 1 interview round.

Round 1 - Jewellery 

(2 Questions)

  • Q1. How to make a unique jewellery?
  • Ans. 

    To make a unique jewellery, focus on the design, materials, and personalization.

    • Create a unique design that stands out from the crowd.

    • Use high-quality materials such as precious metals, gemstones, and unique materials like wood or resin.

    • Personalize the jewellery by adding initials, birthstones, or other meaningful elements.

    • Consider the latest trends and incorporate them into the design.

    • Collaborate with customers to cre...

  • Answered by AI
  • Q2. Which material used make a unique jewellery piece?
  • Ans. 

    The material used to make a unique jewellery piece depends on the design and creativity of the jeweller.

    • Jewellers can use a variety of materials such as precious metals like gold, silver, and platinum

    • They can also use gemstones like diamonds, rubies, and sapphires

    • Other materials like pearls, beads, and crystals can also be used to create unique jewellery pieces

    • The choice of material depends on the design, style, and bu

  • Answered by AI

Interview Preparation Tips

Topics to prepare for Nykaa Sales & Marketing interview:
  • How to make a unique jewellery
Interview preparation tips for other job seekers - I will make a unique jewellery piece for nykaa and I sure nykaa liked my designs

I applied via Campus Placement

Round 1 - Group Discussion 

Flipkart has 46 million users; how would you add 100 million more users in 2 years. 15 minutes of group discussion, followed by 30 seconds suggestion by everyone.

Round 2 - Product Management 

(2 Questions)

  • Q1. Tell me about yourself.
  • Q2. How has marketing changed over the last few years?
  • Ans. 

    Marketing has become more digital and personalized in recent years.

    • Increased use of social media and online advertising

    • Focus on targeted and personalized messaging

    • Growing importance of data analytics and automation

    • Shift towards inbound marketing and content creation

    • Rise of influencer marketing and user-generated content

    • Integration of technology such as AI and chatbots

    • Greater emphasis on customer experience and engageme

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Mock GDs/PIs.

I applied via Campus Placement

Round 1 - Case Study 

Interview Preparation Tips

Interview preparation tips for other job seekers - • Don’t shout in GDs. Shouting leads to scrapping the entire panel.
• Interact with seniors.

I applied via Naukri.com and was interviewed in Oct 2020. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. Vision in the company

Interview Preparation Tips

Interview preparation tips for other job seekers - Ask questions according to my degree basis.

Interview Questionnaire 

2 Questions

  • Q1. How many onboarding in a day..?
  • Q2. What is filipkart..?
  • Ans. 

    Flipkart is an Indian e-commerce company that sells a wide range of products online.

    • Founded in 2007 by Sachin Bansal and Binny Bansal

    • Acquired by Walmart in 2018

    • Offers products in various categories such as electronics, fashion, home appliances, and more

    • Provides various payment options including cash on delivery, credit/debit cards, and net banking

    • Has a loyalty program called Flipkart Plus for frequent shoppers

  • Answered by AI

I was interviewed before Dec 2020.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This round was purely based on Data Structures and Algorithms . One has to be fairly comfortable in solving Algorithmic problems to pass this round . Both the questions asked were quite common and luckily I had already prepared them from CodeStudio and LeetCode.

  • Q1. 

    Binary Tree Traversals Problem Statement

    Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...

  • Ans. 

    Compute the In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.

    • Implement functions to perform In-Order, Pre-Order, and Post-Order traversals of a Binary Tree.

    • Use level-order input to construct the Binary Tree.

    • Traverse the Binary Tree recursively to generate the required traversals.

    • Ensure proper handling of null nodes represented by -1 in the input.

    • Return the three traversals as

  • Answered by AI
  • Q2. 

    Reverse Linked List Problem Statement

    Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.

    Input:

    The first line of input is an intege...
  • Ans. 

    Reverse a singly linked list by altering the links between nodes.

    • Iterate through the linked list and reverse the links between nodes

    • Use three pointers to keep track of the current, previous, and next nodes

    • Update the links between nodes to reverse the list

    • Return the head of the reversed linked list

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 45 Minutes
Round difficulty - Medium

This round basically tested some concepts from Data Structures and File Manipulation .

  • Q1. 

    Intersection of Two Arrays Problem Statement

    Given two arrays A and B with sizes N and M respectively, both sorted in non-decreasing order, determine their intersection.

    The intersection of two arrays in...

  • Ans. 

    The problem involves finding the intersection of two sorted arrays efficiently.

    • Use two pointers to iterate through both arrays simultaneously.

    • Compare elements at the pointers and move the pointers accordingly.

    • Handle cases where elements are equal and update the intersection array.

    • Return the intersection array as the result.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPABig Basket interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, Operating Systems, 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 interviewSelected

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

Meesho Interview FAQs

How many rounds are there in Meesho Sales & Marketing interview?
Meesho interview process usually has 5 rounds. The most common rounds in the Meesho interview process are Assignment, Resume Shortlist and Group Discussion.
What are the top questions asked in Meesho Sales & Marketing interview?

Some of the top questions asked at the Meesho Sales & Marketing interview -

  1. Technically service online services fastest and best disco...read more
  2. Hr advised and discuss the product va...read more

Tell us how to improve this page.

Interview Questions from Similar Companies

Flipkart Interview Questions
4.0
 • 1.3k Interviews
Swiggy Interview Questions
3.8
 • 428 Interviews
BigBasket Interview Questions
3.9
 • 359 Interviews
Udaan Interview Questions
4.0
 • 334 Interviews
CARS24 Interview Questions
3.5
 • 331 Interviews
Myntra Interview Questions
4.0
 • 214 Interviews
Blinkit Interview Questions
3.7
 • 181 Interviews
BlackBuck Interview Questions
3.8
 • 176 Interviews
FirstCry Interview Questions
3.6
 • 169 Interviews
Tata 1mg Interview Questions
3.6
 • 146 Interviews
View all

Meesho Sales & Marketing Reviews and Ratings

based on 3 reviews

4.6/5

Rating in categories

4.8

Skill development

4.6

Work-life balance

4.8

Salary

3.7

Job security

4.6

Company culture

3.5

Promotions

4.8

Work satisfaction

Explore 3 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.3
Compare
Did you find this page helpful?
Yes No
write
Share an Interview