MakeMyTrip interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

MakeMyTrip
3 rounds | 3 Coding problems

Interview preparation journey

Preparation
Duration: 5 Months
Topics: Data Structures, Algorithms, OOPS, OS, DBMS
Tip

Tip 1 : Work on Competitive Programming skills. That is one thing most companies look out for during hiring. Solve at least 100
questions from every topic.
Tip 2 : You should have at least 2 good projects on your resume. Only write the things that you are completely sure of.
Tip 3 : Work on CS fundamentals as well like -OOPS, OS, and DBMS. There will be MCQ questions from this in the coding round as well as in the 1:1 round

Application process
Where: Campus
Eligibility: No criteria
Resume tip

Tip 1 : Need at least 2 good projects on the resume. Write a short 2-3 lines summary of the project and the tech stack
used.
Tip 2 : Resume should be 1 page only. Try to keep the Resume short with useful information only.
Tip 3 : Your Resume should clearly mention the skillset you have. Companies sometimes filter out Resume based on
skillset only

Interview rounds

01
Round
Easy
Face to Face
Duration50 Minutes
Interview date10 Jun 2020
Coding problem1

It was on zoom from 5PM.

1. Next Greater Element

Easy
10m average time
90% success
0/40

You have been given an array/list â€˜ARRâ€™ consisting of â€˜Nâ€™ positive integers. Your task is to return the Next Greater Element(NGE) for every element.

View more
Problem approach

It can be solved by taking 2 arrays: LeftArray[] and RightArray[].
LeftArray should contain max element from left side till index i. RightArray should contain the min element from the right side starting from the last index.

Now iterate over the given array and check if its greater than leftarr[i-1] and smaller than rightArray[i+1], if yes then print it else skip

02
Round
Easy
Face to Face
Duration60 Minutes
Interview date13 Jun 2020
Coding problem1

1. Connect Nodes at Same Level

Moderate
30m average time
70% success
0/80

You are given a binary tree, where the structure of the node is as follow -:

View more
Problem approach

It can easily be solved by level order traversal. We only need to check the condition if the element->nextRight is NULL then point this element to NULL. Also one case can be to mark next of root element as NULL

03
Round
Easy
HR Round
Duration30 Minutes
Interview date16 Jun 2020
Coding problem1

1. Basic HR Questions

Why do you want to change?
What You are expecting from this role?
How will you resolve conflicts with your team members?

Problem approach

Tip 1 : Prepare keep answers to some basic HR Questions ready before the interview
Tip 2 : Keep answers short and to the point
Tip 3 : Don't oversell yourself. For ex: sometimes people keep saying they are very hardworking and it's their weakness and all. Please don't say these things as it might give wrong impression to interviewer

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

What is the return type of a method that doesn't return any value?

Start a Discussion
Similar interview experiences
SDE - 1
3 rounds | 3 problems
Interviewed by MakeMyTrip
569 views
SDE - 1
2 rounds | 5 problems
Interviewed by MakeMyTrip
325 views
SDE - 1
1 rounds | 2 problems
Interviewed by MakeMyTrip
278 views
SDE - 1
3 rounds | 5 problems
Interviewed by MakeMyTrip
316 views
Companies with similar interview experiences
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
102216 views