i
Meesho
Filter interviews by
I applied via Company Website and was interviewed in Jan 2022. There were 5 interview rounds.
Marketing and selling
Best policy in the product assistant manager
Top trending discussions
I applied via Recruitment Consulltant and was interviewed before Jul 2021. There were 4 interview rounds.
The second round is qualified to documentation round
Open mind test, attitude test
How much salary do you expectation now?
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
I applied via Approached by Company and was interviewed in Oct 2022. There was 1 interview round.
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...
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
I applied via Campus Placement
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.
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
I applied via Campus Placement
I applied via Naukri.com and was interviewed in Oct 2020. There was 1 interview round.
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
I was interviewed before Dec 2020.
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.
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...
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
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
The first line of input is an intege...
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
Round duration - 45 Minutes
Round difficulty - Medium
This round basically tested some concepts from Data Structures and File Manipulation .
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...
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.
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.
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.
I was interviewed before Jan 2021.
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.
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...
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.
Determine if the given binary tree is height-balanced. A tree is considered height-balanced when:
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'
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...
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 .
Given a string S
of length L
, determine the length of the longest substring that contains no repeating characters.
"abac...
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
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 ...
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.
Given an array ARR
and an integer K
, your task is to count all subarrays whose sum is divisible by the given integer K
.
The first line of input contains an...
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.
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.
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...
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.
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...
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...
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.
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.
based on 3 reviews
Rating in categories
Key Account Manager
745
salaries
| ₹0 L/yr - ₹0 L/yr |
City Manager
205
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Analyst
190
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Development Manager
171
salaries
| ₹0 L/yr - ₹0 L/yr |
Team Lead
166
salaries
| ₹0 L/yr - ₹0 L/yr |
Amazon
Flipkart
Myntra
GlowRoad