MakeMyTrip interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
MakeMyTrip
1 rounds | 2 Coding
problems
Rejected
Interview preparation journey
Journey
I started coding two years ago.
I got an internship at an excellent product-based company.
I learned data structures, algorithms, and core concepts.
The core concepts I have learned include the operating system, DBMS, computer networks, etc.
I have also dedicated more time to concepts like dynamic programming, greedy algorithms, and graphs.
For a full-time role, you must ensure that your soft skills are also strong enough to explain your thought process clearly.
Application story
It was an on-campus opportunity.
There was an online coding round, followed by 2 technical rounds and a 1-hour round.
In each round, there were questions on core concepts and data structures and algorithms.
Why selected/rejected for the role?
I solved all the questions, but I took more time than the other guys. My rank was not good, so I was not selected for the interview round.
Preparation
Duration: 6 months
Topics: DP, Array, Greedy, Linked list, Graph, HashMap
Tip 1: The main focus should be on coding.
Tip 2: Also focus on soft skills.
Application process
Where: Campus
Eligibility: 7.5 CGPA
Tip 1: The resume should be strictly one page.
Tip 2: Include two projects.
Interview rounds
01
Round
Medium
Online Coding Interview
Duration90 mins
Interview date17 Aug 2022
Coding problem2
1. Longest Repeating Substring
Moderate
10m average time
90% success
0/80
Asked in companies
You are given a string 'str' of length 'N'. You can perform at most 'k' operations on this string. In one operation, you can choose any character of the string and change it to any other uppercase English alphabet character.
Return the length of the longest substring containing same characters after performing the above operations.
For example :
Input:
str="AABC" k=1
Output:3
Explanation: Replace 'B' with 'A', we will get "AAAC" and the longest substring with same character is "AAA" of length 3.
Problem approach
Length of longest non-repeating substring can be recursively
defined as below.
LCSRe(i, j) stores length of the matching and
non-overlapping substrings ending
with i'th and j'th characters.
If str[i-1] == str[j-1] && (j-i) > LCSRe(i-1, j-1)
LCSRe(i, j) = LCSRe(i-1, j-1) + 1,
Else
LCSRe(i, j) = 0
Where i varies from 1 to n and
j varies from i+1 to n
2. Check Whether Binary tree Is Complete
Moderate
25m average time
70% success
0/80
Asked in companies
You are given a binary tree. Your task is to check whether the given binary tree is a Complete Binary tree or not.
A Complete Binary tree is a binary tree whose every level, except possibly the last, is completely filled, and all nodes in the last level are placed at the left end.
Example of a complete binary tree :
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 
1209 views
0 comments
0 upvotes
SDE - 1
4 rounds | 13 problems
Interviewed by MakeMyTrip
Selected 1493 views
0 comments
0 upvotes
SDE - 1
2 rounds | 5 problems
Interviewed by MakeMyTrip
Rejected
874 views
0 comments
0 upvotes
SDE - 1
3 rounds | 5 problems
Interviewed by MakeMyTrip
Rejected
726 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