Meesho | SDE-2 | Bengaluru | July 2024 [Reject]
- Result
- Rejected
- Location
- Bengaluru
- Experience
- 2.3 years
- Posted
- 17 Aug 2024
Summary
I interviewed for the SDE-2 role at Meesho in Bengaluru, which involved a DSA round and a Machine Coding round, ultimately leading to a rejection.
How it went
I recently interviewed for the SDE-2 position at Meesho in Bengaluru. My background includes 2.3 years of experience as a fullstack software developer at a product-based MNC. The interview process consisted of two main rounds.
Round 1 (DSA): This one-hour round was conducted on Hackerrank. I was presented with two problems. The first problem was similar to Number of Visible People in a Queue on LeetCode. The second problem was exactly Find the Longest Equal Subarray from LeetCode. I managed to pass all test cases for the first problem and 11 out of 15 for the second, which resulted in my selection for the next round.
Round 2 (Machine Coding): This round lasted two hours and focused on designing a system similar to Splitwise. The requirements included handling expenses split in three ways: EQUAL, EXACT, and PERCENTAGE. I was asked to implement four specific methods: addUser(), splitExpense(), showExpenses(), and showExpensesForUser(). While I structured the code well and applied some design patterns, I unfortunately couldn't complete the full implementation within the allotted time, which led to my rejection.
Questions asked (3)
- 01
Number of Visible People in a Queue
Data Structures & Algorithms · Hard
Open the problemYou are given an integer array
heightsof lengthnrepresenting the heights of people standing in a queue. For each personi, you need to count the number of peoplejsuch thati < j,heights[i] > heights[j], and for allksuch thati < k < j,heights[k] < heights[i]. Return an integer arrayanswerof lengthnwhereanswer[i]is the number of peopleican see to their right in the queue. - 02
Find the Longest Equal Subarray
Data Structures & Algorithms · Medium
Open the problemYou are given a 0-indexed integer array
numsand an integerk. A subarraynums[i..j]is considered an equal subarray if all elements inside of it are equal. Return the length of the longest equal subarraynums[i..j]such thatj - i + 1 - count(nums[i..j]) <= kwherecount(nums[i..j])is the number of distinct elements in the subarray. In simpler terms, you can delete at mostkelements from the subarray to make all remaining elements equal. - 03
Design Splitwise
System Design
Design a system similar to Splitwise. The system should support three ways of splitting expenses: EQUAL, EXACT, and PERCENTAGE. The core functionalities to be implemented include adding users, splitting expenses, showing all expenses, and showing expenses for a specific user. Specifically, I needed to implement the following methods:
addUser(),splitExpense(),showExpenses(), andshowExpensesForUser().