YOE: 2 years 10 months
Company: Meesho
Role: SDE2

Round1 | DS & Algo | 1hr | Hackerrank Platform | Virtual Interview:
Q1: https://leetcode.com/problems/asteroid-collision/
Q2: Given a matrix of m*n with only 0 and 1 vaue. Each cell having value 1 is connected to its adjacent cell (up, down, right and left). Get number of 1s in all of the connected components. Given a query array where each elements represents number of 1s. Tell for each and every query that how many components have exactly query[i] number of 1s. (LIKE https://leetcode.com/problems/number-of-islands/)
Solution: Similar to above and also count number of 1s in a connected component
create map<int, int> which stores <x,y> where x is the number of 1s in a connected component and y is the occurences of x.
At last for every query, return map[ query[i]]

Round2 | Machine Coding | 2hr 15 minutes | Hackerrank Platform | Virtual Interview:
Exactly same as Round2 in https://leetcode.com/discuss/interview-experience/2017271/Meesho-(Offer)-or-SDE-2-or-Remote

Round3 | Hiring Manager | 1 hr | Virtual Interview:
Exactly same as Round3 in https://leetcode.com/discuss/interview-experience/2017271/Meesho-(Offer)-or-SDE-2-or-Remote
Design a ranking and review system for an ecommerce website.
Requirements:

• user should be able to give review of a product
• user should be able to rate the product
• user should be able to sort the product list based on rating and most recent
• user should be able to apply the filter based on the ratings
• user should be able to like and dislike the review
• whenever user check a product, an average rating must be shown there

Discuss an HLD for this.
Database Design
write getProductList() api

Follow up questions:
SQL or NoSQL
Mongodb or Redis
Consistency vs Eventual Consistency

VERDICT: SELECTED