Meesho Interview Experience || SDE 1 || On-campus
Status: Fresh grad, ECE from Tier 2 university(NIT) in India
Experience: 3 months intern.
Position: SDE 1 at Meesho
Location: Bangalore, India
Date: Feb 2021
Timeline
- There were 4 rounds in total.
- Each round is eliminatory.
- Got an offer letter within 1 week after the final result declaration.
Round 1: OT
Online test on hackerRank Platform consisting of 3 coding questions + some basic CS fundamentals MCQs.
- LC easy level, something like the union of two sets.
- LC easy-medium level, some string-based question couldn’t recall exactly.
- LC medium-hard level, (https://www.geeksforgeeks.org/count-substrings-that-contain-all-vowels-set-2/)
I have solved all coding questions completely and also did well in MCQs Section. Those who solved all coding questions completely are shortlisted for the next round.
Round 2: Online Coding Interview
This round was purely based on problem-solving and DS Algo's skill lasted for almost 1hr:30min, you have to solve(run all the provided test cases) the questions assigned to you and also have to explain the space and time complexity of the most optimal solution.
The round started with an introduction, the interviewer also introduced himself, gave some insight of Meesho, then he directly moved to the code editor,
I have been asked 3 questions:-
- To find the total number of pairs in an array whose sum is in multiple of 60, It took me around 25 mins to reach the most optimal solution and pass all test cases. The last five minutes spent debugging int overflow issue (Hint given by interviewer why last two cases were not passing)
- I was a bit nervous coz It’s almost past 40 minutes since the interview started and I have solved only one questions, fortunately, I managed to solve the second question Blanzingly fast, within 5–10 mins, the question was something like, find the total number of elements in set 1 whose value is less than or equal to given each index value of another set (YOU have to figure out this by urself). I have used the concept of Upper_bound, and in one go I managed to pass all the test cases, Interviewer seems quite impressed, and asked me to explain the approach along with their time and space complexity.
- Standard Knapsack problem with little modification, I gave him the recursive approach and managed to pass 5/13 test cases, Explain the way to make it more optimal by memoization it, but have not coded coz time nearly runs out, At last, he told me AW we are looking for only two problems in this round as you have solved first and second quickly so I have given this to you.
NOTE:- Those who solved 1.5+ are shortlisted for the next round. If you solved 1st question completely then only they assigned you the next question and so on…..
Round:3 General Tech Round
This round lasted for almost 40–45 mins, In this round, they mainly ask about all your past work experiences, projects and look at your thought process and approach to problems by asking random design questions. He asked me to design hash_map differently from the existing one he had also added some constraints, I have explained my approach to him, a lot of follow-ups questions were there, at last, he seems satisfied with my answer, Asked about mutex that who owns the mutex if there will be 10 threads running in parallel in respect to GoLang. At last, he asked me why Meesho? And told me to ask any questions if I have, and the round ended.
Got the result on the same day that I was shortlisted for the hr_discussion round.
Round:4 Hr_discussion
This round was a kind of formal discussion with company HR, He gives me the company’s Insight, vision, and what actually it does, Lasted for almost 15–20 mins, And in this round only he told me that I was the final selects from my college.
Got a mail from tnp just after the round that I was selected! ✌
Take Away :
- Try solving medium-level LC questions with different approaches if possible.
- Don’t settle always keep striving for more.
- Maintain consistency by setting up the daily streak, the result will come for sure, and keep Coding until it doesn’t.
