***Meesho SDE-I Interview Experience***\n\n**Experience**: 8 Months FT + 6 Months Intern\n**Position**: Software Engineer 1\n**Location**: Bangalore, India\n**Current Company**: Fintech Startup\n\nGot a call from recruiter on 3rd of March 2024, he asked me about my tech stack which i use currently at my present company & current compensation. At last he told me that he will send me an invite for Online Assesment. Recruiter got my profile from linkedin.\n\n**Round - I : (8th March | Online Assessment | 100 mins | Hackerrank Platform)**\n\nGot an hackerrank link. The OA consisted of 3 DSA problems.\n\n***Ques 1*** - 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]. [***Hard***]\n\n***Ques 2*** - 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. [***Medium***]\n\n***Ques 3*** - 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:\n* Choose some i (1 <= i <= length of the array) and delete arr[i] without changing the order of the remaining elements. [***Medium***]\n\nWas able to solve all the 3 questions within given time constraint. \uD83D\uDE07\n\n**Round - II : (2nd April | Machine Coding | 90 mins | Hackerrank | Virtual Interview)**\n\nGot a call from recruiter on 12th of March that i have qualified for next round and she schedule interview for 2nd of April.\n\n***Ques*** - Design Social Media with following functionalities\n* Create Post\n* Delete Post\n* Get Feed (Latest of the user & their followers)\n* Get Feed Paginated\n* Follow user\n* Unfollow user\n\nMachine coding round with few test cases around it which you need to clear. I was able to explain my whole approach and also coded it in 60 mins only. There was mandatory functions and bonus functions to implement. I was able to impement all the functionality. \uD83E\uDD1E\n\n**Round - III (21st May | Code pair | 60 mins | Hackerrank | Virtual Interview):**\n\nGot confirmation from HR on 15th of April that i have qualified for next round but it was scheduled on 21st of May.\n\nInterviewer told me that there will be two DSA quesions to be solved in 60 mins.\n\n***Ques 1*** - It was related to a stack based **balls collision** question. [***Medium***]\nWas able to solve & describe it in 40 mins. This ques took more time due to edge cases which needs to be handled properly.\nhttps://leetcode.com/problems/asteroid-collision/description/\n\n***Ques 2*** - It was hashmap and string based question. [***Medium***]\n\nI was able to solve both the questions within given time duration. \n\n**Round - IV (30th May | HM Round | 60 mins | Google Meet):**\n\nGot confirmation from HR that i have qualifed for GM round and it was scheduled for 30th of May. \n\nThe interview began with the interviewer introducing himself. He has 11 years of experience and has 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.\n\nResult: **I am pleased to share that I have received confirmation from HR that I have been selected for the SDE 1 position at Meesho.** \u270C\uFE0F

Meesho SDE-I Interview Experience\n\nExperience: 8 Months FT + 6 Months Intern\nPosition: Software Engineer 1\nLocation: Bangalore, India\nCurrent Company: Fint