MakeMyTrip Interview Experience for SDE | On -Campus

It was completely online over zoom calls. 36 students were selected for the interview. 7 selected.Round 1 (Written): It was a written round consisting of 20 MCQs and 2 cod...

It was completely online over zoom calls. 36 students were selected for the interview. 7 selected. Round 1 (Written): It was a written round consisting of 20 MCQs and 2 coding questions, 2hrs in total. MCQs consisted of all computer science basics including SQL, DBMS, CN, OS, Linux commands. Coding questions were easy. The first question was the inversion count Practice Link: Count Inversions The second question was to find a maximum number of consecutive 1's in the array if you can flip at most k 0's. Article Link: Find zeroes to be flipped so that number of consecutive 1’s is maximized Practice Link: Maximize Number of 1's Round 2 (Technical, 1 hr): 36 students appeared for this round. It started with my introduction while the interviewer had a look at my resume. He asked me about process and threads, multithreading, if multithreading is synchronous or parallel, semaphores, and race conditions in Operating Systems. I had added a project with MongoDB in my resume, so he asked me about the difference between SQL and MongoDB, why did I use MongoDB and not SQL, their advantages and disadvantages, joins in SQL, how will the joins work, using examples. Then he moved on to the OOPS. Difference between polymorphism and abstraction . Then he asked me about encapsulation. He asked me if I was mixing encapsulation and abstraction but I was clear with their concepts hence was confident about my answer. Then he moved on to the DSA. He asked me about the Tower of Hanoi Practice Link: Help The Old Man Find the Minimum length Unsorted Subarray, sorting which makes the complete array sorted . Practice Link: length of unsorted subarray Then he asked me that we have a node containing some data let's say name class roll no. and so on. and in each iteration, we change any one attribute of the node and store it in a new node. Which data structure would be the most suitable to store this. The answer is a linked list as it will tell us in which iteration what change was made. So, each and every concept was asked in this round. But the interviewer was friendly, it went really well. Around 14 students were able to make it through this round. Round 3 (Technical, 45 min): It started with an introduction and OOPS concepts like polymorphism and abstraction. Then we jumped to the DSA part. The first question was to find the square root of a number. I told him the brute force approach and then the binary search approach. I was able to find an integral part of the answer. Then he asked me to find the fractional part. I tried but was unable to solve it. Then we moved on to the next question. It was to implement a stack and a queue in a single 1-D array. Only 7 students made it to the

next round. Round 4(HR): It was a telephonic HR round. The HR called me and we had a great talk for about 10 minutes. She asked me about my family and how did my two interview rounds go. What kind of work culture I preferred. Be clear and honest with your answers. All 7 students were selected.