i
Meesho
Filter interviews by
I appeared for an interview in May 2022.
I appeared for an interview in Jun 2021.
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.
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.
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
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...
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
Round duration - 135 minutes
Round difficulty - Medium
Machine Coding.
Timing: Afternoon
The interviewer was answering my questions nicely.
Round duration - 60 minutes
Round difficulty - Medium
Hiring Manager.
Interviewer: Sr Engineering Manager.
Timing: evening.
The environment was cool.
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.
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.
I applied via Job Portal and was interviewed in Jun 2024. There were 3 interview rounds.
I don't remember the ques
Design a scalable notification system for sending real-time alerts to users.
Use a distributed system to handle high volume of notifications.
Implement message queues for asynchronous processing.
Utilize push notifications for mobile devices.
Include a user preference system for customizing notification settings.
Consider implementing a notification history feature for users to view past alerts.
Google Pay is a digital wallet platform and online payment system developed by Google.
Google Pay uses secure tokenization to protect user's payment information.
It integrates with various payment methods like credit/debit cards, UPI, and NFC.
The system handles transactions, user authentication, and merchant integrations.
Google Pay leverages Google's infrastructure for scalability and reliability.
It provides features lik...
I applied via LinkedIn and was interviewed in Jun 2024. There was 1 interview round.
The minimum cost to connect the ropes is calculated by repeatedly connecting the two smallest ropes until all ropes are connected.
Sort the ropes in ascending order.
Repeatedly connect the two smallest ropes.
Add the cost of connecting the two ropes to the total cost.
Continue this process until all ropes are connected.
The question asks for the maximum value of arr[i]+arr[j]+i-j for given array arr.
Iterate through all possible pairs of i and j in the array
Calculate the value of arr[i]+arr[j]+i-j for each pair
Keep track of the maximum value found
What people are saying about Meesho
I applied via Naukri.com and was interviewed before Sep 2021. There was 1 interview round.
I appeared for an interview before Sep 2021.
I applied via Walk-in and was interviewed in Feb 2020. There were 3 interview rounds.
I applied via Indeed and was interviewed in Oct 2020. There was 1 interview round.
I appeared for an interview in Nov 2020.
based on 7 reviews
Rating in categories
Key Account Manager
783
salaries
| ₹3 L/yr - ₹7 L/yr |
City Manager
237
salaries
| ₹4 L/yr - ₹10 L/yr |
Business Analyst
218
salaries
| ₹12 L/yr - ₹21.6 L/yr |
Senior Business Analyst
171
salaries
| ₹17 L/yr - ₹28 L/yr |
Team Lead
168
salaries
| ₹3.3 L/yr - ₹7 L/yr |
Amazon
Flipkart
Myntra
GlowRoad