MakeMyTrip interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
MakeMyTrip
3 rounds | 4 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 2 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Java J2EE
Tip 1 : Get strong hold of the basics of DS and algo
Tip 2 : Among the Computer Engineering subjects, you should be very handy with the concepts from DBMS
Tip 3 : Practice.
Application process
Where: Other
Tip 1 : Keep the resume as concise as possible.
Tip 2 : Write only relevant projects you did and specify all the previous experiences in short sentences which will give the idea of what the project was.
Interview rounds
01
Round
Easy
Video Call
Duration60 minutes
Interview date17 Dec 2021
Coding problem1
First 30 minutes was my introduction and discussion about my previous organization's work. Then one coding question.
1. Maximum Distance
Moderate
15m average time
80% success
0/80
Asked in companies
You have been given an array 'A' of N integers. You need to find the maximum value of j - i subjected to the constraint of A[i] <= A[j], where ‘i’ and ‘j’ are the indices of the array.
For example :
If 'A' = {3, 5, 4, 1}
then the output will be 2.
Maximum value occurs for the pair (3, 4)
Problem approach
Efficient approach
The idea behind this approach is to create a monotonously decreasing array and comparing its values with the given array to find the maximum distance.
Create an auxiliary array ‘RMax’ such that ‘RMax’ holds the greatest element on the right side of the given array.
Declare a variable ‘diff’ initialized to -1 to find the maximum distance.
Now traverse both the arrays simultaneously from left to right and check for the condition.
If A[i] is greater than RMax[j], then we must move ahead in A[] (or do i++) because all elements on left of A[i] are greater than or equal to A[i].
Otherwise, we must move ahead in RMax[j] to look for a greater j – i value.
We keep on updating the value of ‘diff’ at each comparison.
Space Complexity: O(n)Explanation:
O(N), where ‘N’ is the size of the array.
An auxiliary array of size N is used for the comparisons. So space complexity will be O(N).
Time Complexity: O(n)Explanation:
O(N), where ‘N’ is the size of the array.
We are iterating through the array only once. So overall time complexity will be O(N).
02
Round
Easy
Video Call
Duration60 minutes
Interview date4 Jan 2022
Coding problem2
Questions on OOPS (almost all the concepts were covered like polymorphism, overriding, overloading, inheritance, concept of virtual fxns etc.)
1. Theory questions
- What is polymorphism?
- What is function overriding?
- Explain function overloading?
- What is inheritance? Explain different kinds of inheritance
- What do you know the concept of virtual functions?
Problem approach
Tip 1 : Prepare well for the OOPs concepts
Tip 2 : Also be aware of the position you're applying to. If Java developer, be aware of the concepts of JAVA.
2. Maximum Consecutive Ones
Moderate
30m average time
70% success
0/80
Asked in companies
Given a binary array 'ARR' of size 'N', your task is to find the longest sequence of continuous 1’s that can be formed by replacing at-most 'K' zeroes by ones. Return the length of this longest sequence of continuous 1’s.
03
Round
Easy
HR Round
Duration60 minutes
Interview date6 Jan 2022
Coding problem1
The discussion was mainly around the projects in MMT and about my projects in my previous organisation.
1. Basic HR Questions
- Tell me about yourself
- Explain your role in the project you worked on in your previous organisations
- What are your strength and weakness?
Problem approach
Tip 1 : Don't put too much skills/projects if you are not confident about it, u need not have very rich resume during on campus placements
Tip 2 : Leadership principles can be very helpful for behavioural questions.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
How do you remove whitespace from the start of a string?
Choose another skill to practice
Similar interview experiences
SDE - 1
3 rounds | 3 problems
Interviewed by MakeMyTrip
Selected 
1210 views
0 comments
0 upvotes
SDE - 1
4 rounds | 13 problems
Interviewed by MakeMyTrip
Selected 1494 views
0 comments
0 upvotes
SDE - 1
2 rounds | 5 problems
Interviewed by MakeMyTrip
Rejected
875 views
0 comments
0 upvotes
SDE - 1
3 rounds | 5 problems
Interviewed by MakeMyTrip
Rejected
727 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
Selected 115097 views
24 comments
0 upvotes
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
Selected 58238 views
5 comments
0 upvotes
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
Selected 35147 views
7 comments
0 upvotes