Meesho | Backend Developer - 1 | Bangalore | Selected

I got a call from a recruiter on March 3, 2024, after they found my profile on LinkedIn. They inquired about my current tech stack and compensation before scheduling an invite for an Online Assessment. My experience was 8 Months Full-Time and 6 Months Internship.

Round - I: Online Assessment (March 8 | 100 mins | Hackerrank Platform)

The OA consisted of 3 DSA problems:

• Ques 1 (Hard): Given a 2-d array of integers of size n^2 data, data[i] represents that the ith data point was inserted into the cache at time data[i][0]. It lives in the cache for data[i][1] time. For an array of q queries, queries[q], find the number of data items in the cache at each time query[i].
• Ques 2 (Medium): Given two arrays each of length n, arr1, and arr2, in one operation, any two elements of an array can be swapped. This can occur any number of times. Find the maximum possible sum of i*(arr2[i]-arr1[i]) for all 1 <= i <= n after rearranging the arrays.
• Ques 3 (Medium): The beauty of an array of length m is defined as the number of integers i (1 <= i <= m) such that a[i]=i. Given an array arr of n integers, the following operations can be performed on the array while its length is greater than 1: Choose some i (1 <= i <= length of the array) and delete arr[i] without changing the order of the remaining elements.

I was able to solve all three questions within the given time constraint. 😊

Round - II: Machine Coding (April 2 | 90 mins | Hackerrank | Virtual Interview)

I received a call from the recruiter on March 12, informing me that I had qualified for the next round, which was scheduled for April 2.

The task was to design a Social Media system with the following functionalities:

• Create Post
• Delete Post
• Get Feed (Latest of the user & their followers)
• Get Feed Paginated
• Follow user
• Unfollow user

This machine coding round involved several test cases that needed to be cleared. I was able to explain my whole approach and code it in just 60 minutes. There were mandatory and bonus functions to implement, and I successfully implemented all of them. 🧑‍💻

Round - III: Code Pair (May 21 | 60 mins | Hackerrank | Virtual Interview)

The HR confirmed on April 15 that I had qualified for the next round, which was scheduled for May 21.

The interviewer told me that there would be two DSA questions to be solved in 60 minutes.

• Ques 1 (Medium): It was related to a stack-based balls collision question, similar to Asteroid Collision. I was able to solve & describe it in 40 mins. This question took more time due to edge cases which needed to be handled properly.
• Ques 2 (Medium): It was a hashmap and string based question.

I was able to solve both questions within the given time duration.

Round - IV: HM Round (May 30 | 60 mins | Google Meet)

I received confirmation from HR that I had qualified for the HM round, which was scheduled for May 30.

The interview began with the interviewer introducing himself. He had 11 years of experience and had been with Meesho for the past 6 years. Afterward, I introduced myself, and we proceeded to discuss my projects in detail. The conversation then delved into handling high-traffic scenarios and various transactional concepts in Spring Boot.

Result: I am pleased to share that I have received confirmation from HR that I have been selected for the SDE 1 position at Meesho. ✌️