Add office photos
i
MakeMyTrip
Compare
Filter interviews by
MakeMyTrip Interview Questions, Process, and Tips
Top MakeMyTrip Interview Questions and Answers
- Q1. Minimum Jumps Bob lives with his wife in a city named Berland. Bob is a good husband, so he goes out with his wife every Friday to ‘Arcade’ mall. ‘Arcade’ is a very famou ...read moreasked in Software Developer interview
- Q2. Tower of Hanoi You are given three rods (numbered 1 to 3), and ‘N’ disks initially placed on the first rod, one on top of each other in increasing order of size ( the lar ...read moreasked in Full Stack Developer interview
- Q3. In a normal e-commerce user flow, how will you determine the points at which the drop-off rates are high and what to do about them? (Take any e-commerce website and walk ...read moreasked in Product Manager interview
MakeMyTrip Interview Experiences
121 interviews found
Anonymous
Selected
I applied via Approached by Company and was interviewed before May 2023. There were 3 interview rounds.
(1 Question)
- Q1. Architecture of Automation and java basics
Real time problems and solutioning
Logical and basics of web and API. fittment
Interview Preparation Tips
QA Engineer Interview Questions asked at other Companies
CodingNinjas
I was interviewed in Sep 2021.
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
The test was in the morning at around 11.
It was on online assessment.
HackerEarth was perfect like everytime.\
MCQ were based on HTML ,CSS , JS, OOPS, SQL, Aptitude, OS.
- Q1. Reach the destination
Given a source point (sx, sy) and a destination point (dx, dy), the task is to check if it is possible to reach the destination point using the following valid moves:
(a, b) -> (a... - Ans. Brute force approach
The naive approach to solve this problem is to consider each and every possible move until we reach the destination.
This can be done using recursion. Below is the algorithm:
- Check for the bases:
- If the source and destination coordinates are the same, return true.
- Return false, if the x (or y) coordinate of source point is greater than the x (or y) coordinate of the destination point. As the...
- Check for the bases:
- Q2. Delete Node In BST
You have been given a Binary Search Tree of integers with ‘N’ nodes. You are also given data of a node of this tree. Your task is to delete the given node from the BST.
A binary search...
- Ans. SUCCESSOR
When we delete a node, three possibilities arise:
- Node to be deleted is a leaf node: Simply remove it from the tree.
- Node to be deleted has only one child: Copy that child to the node and delete the child.
- Node to be deleted has two children: Find the inorder successor of the node. Copy contents of the inorder successor to the node and delete the inorder successor.
The inorder successor of a node in BS...
(3 Questions)
Round duration - 90 Minutes
Round difficulty - Hard
The interviewer was very friendly. He gave me problems one by one and asked me to write code for all of them in Code Pair round. Explain Scope and Scope Chain in javascript. What is a Stored Procedure in SQL?
- Q1. Shortest Path in a Binary Matrix
You have been given a binary matrix of size 'N' * 'M' where each element is either 0 or 1. You are also given a source and a destination cell, both of them ...
- Ans. Backtracking
To find the shortest path in the Binary Matrix, we search for all possible paths in the Binary Matrix from the source cell to the destination cell until all possibilities are exhausted. We can easily achieve this with the help of backtracking.
We start from the given source cell in the matrix and explore all four paths possible and recursively check if they will lead to the destination or not. Out of a...
- Q2. Pair Sum
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to return the list of all pairs of elements such that each sum of elements of each pair eq...
- Ans. Brute Force
- Initialize a list to store our results.
- For each element in the array 'ARR[i]', check if ('ARR[i]' + ‘ARR[j]’), equals to given sum or not, where ‘i’ < ‘j’ < ‘N’.
- If the condition matches, add the pair('ARR[i]', ‘ARR[j]’) to the list. Sort the list of pairs as per the given output format and return this list.
O(1).
Constant extra space is required.
Time Complexity: O... - Q3. Validate BST
You have been given a binary tree of integers with N number of nodes. Your task is to check if that input tree is a BST (Binary Search Tree) or not.
A binary search tree (BST) is a binary tr...
- Ans. BST property
The approach is based on the fact that the value of each node in a BST is greater than the value of all the nodes in the left subtree and smaller than the value of all the nodes in the right subtree.
Here is the complete algorithm-
- For each node, we store the minimum and maximum value allowed for that node. Initially, for the root node, the minimum value would be -10^9 and the maximum value should be 10...
(3 Questions)
Round duration - 45 minutes
Round difficulty - Medium
The round was with CTO level person. He was very friendly. What is the difference between SQL and MySQL? What are Constraints in SQL?
- Q1. OS Questions
Cache Memory.
Critical Section Problem.
Mutex vs Semaphore. - Q2. Longest Duplicate SubString
You are given a string 'S' and you need to return the length of the longest duplicate substring in the given string. The occurrence of duplicate sub-strings can overlap ...
- Ans. Approach1
The key idea is to find all possible substrings and keep the count of all substrings and return the length longest substring which appears more than once.
Algorithm:
- Create an ans variable initial value 0.
- Run a loop from i = 0 to len of(string).
- Inside this loop run a from j = i to length(string).
- Check if the count of substring from i to j appears more than one time. If it appears more than one ...
- Q3. Maximum Sum Of (i * ARR[i]) Among All Possible Rotations Of An Array
You are given an array 'ARR' consisting of 'N' elements, and you need to find the maximum value of sum(i * ARR[i]) among...
- Ans. Brute Force
It’s important to note that, there are only a finite number of unique arrangments of the array possible after applying rotation operations on the array any number of times. So what we can do is find the sum(i*ARR[i]) for all possible rotations and return the maximum among them.
Here is the algorithm :
- Create a variable (say, ‘maxSum’) and initialise it to 0.
- Run a loop from 0 to 'N - 1' (say, iterat...
Interview Preparation Tips
Tip 1 : DSA should be very very good.
Tip 2 : Computer Science Fundamentals are very important
Tip 3 : Think out loud in an interview
Tip 1 : At least 2 very well prepared projects
Tip 2 : Internship experiences always help
Skills evaluated in this interview
Top MakeMyTrip Full Stack Developer Interview Questions and Answers
Full Stack Developer Interview Questions asked at other Companies
Selected
I applied via LinkedIn and was interviewed before Mar 2023. There were 2 interview rounds.
Design a refrigerator for a Blind person.
(1 Question)
- Q1. How will you increase the revenue of Netflix by 10x.
- Ans.
To increase Netflix's revenue by 10x, we can focus on expanding the subscriber base, increasing subscription prices, and diversifying revenue streams.
Expand the subscriber base by targeting new markets and demographics
Increase subscription prices for premium features or exclusive content
Diversify revenue streams through partnerships, merchandise sales, or live events
Interview Preparation Tips
Structure the thoughts, and do not think of the final solution.
Top MakeMyTrip Product Manager Interview Questions and Answers
Product Manager Interview Questions asked at other Companies
Selected
I applied via Recruitment Consulltant and was interviewed before Oct 2022. There were 6 interview rounds.
(1 Question)
- Q1. Basics on Automation
2 programming question moderate level
(1 Question)
- Q1. Java Questions/ Selenium Question/ SQL
(1 Question)
- Q1. Managerial Round. Puzzle/ Basic program
(1 Question)
- Q1. Salary Discussion, basic HR questions
Interview Preparation Tips
Top MakeMyTrip Senior QA Engineer Interview Questions and Answers
Senior QA Engineer Interview Questions asked at other Companies
MakeMyTrip interview questions for popular designations
Selected
I applied via campus placement at Management Development Institute (MDI), Gurgaon and was interviewed before Mar 2023. There were 3 interview rounds.
Asked product improvement questions for Flights funnel like how would reduce the steps the user takes to filter a flight, general case study questions like how many Air India flights fly on a Delhi Mumbai route.
Explain the best product feature that you have built till date and explain the quantitative rationale behind it.
(1 Question)
- Q1. Questions on integrity, hobbies and ethical dilemma questions
Associate Product Manager Interview Questions asked at other Companies
Get interview-ready with Top MakeMyTrip Interview Questions
Selected
I applied via Naukri.com and was interviewed before Mar 2023. There were 3 interview rounds.
Need Good DSA understanding
Need good DSA Handson
(2 Questions)
- Q1. Machince Coding
- Q2. Design of Split Wise
- Ans.
Split Wise is a mobile app that helps friends and roommates split bills and expenses.
Allows users to create groups and add expenses
Calculates each user's share of the expenses
Provides options for settling debts within the group
Sends notifications for pending payments
Supports multiple currencies for international users
Skills evaluated in this interview
Senior Software Developer Interview Questions asked at other Companies
Jobs at MakeMyTrip
Vijay Parihar
(1 Question)
- Q1. What keyskills you have so we will select you.
- Ans.
I have excellent communication skills, strong leadership abilities, and extensive experience in the travel industry.
Strong communication skills, both verbal and written
Leadership abilities and experience managing teams
Extensive knowledge and experience in the travel industry
Ability to analyze data and make informed decisions
Excellent customer service skills
Proficiency in relevant software and technology
Flexibility and ...
Interview Preparation Tips
Senior Travel Executive Interview Questions asked at other Companies
I was interviewed in Sep 2021.
(2 Questions)
Round duration - 90 minutes
Round difficulty - Easy
2 Coding Questions and 20 MCQ's to be solved in 90 minutes. It was from 6 pm. The camera and screen-recorders were on. The mcq was on web, oops, dbms.
- Q1. Number of Islands II
You have a 2D grid of ‘N’ rows and ‘M’ columns which are initially filled with water. You are given ‘Q’ queries each consisting of two integers ‘X’ and ‘Y’ and in each query operation,...
- Ans. Brute Force Approach
The idea here is to represent the grid as a graph and all the adjacent land cells are connected via an edge. Finally, do DFS on the grid and find the number of connected components after each query operation.
The algorithm is as follows:
- Declare an ‘ANS’ array to store the number of islands after each query.
- Declare a 2D array 'GRID' with ‘N’ rows and ‘M’ columns, where ‘GRID[i][j]’ = 0 or 1, 0 r...
- Q2. Make Array Elements Equal
You are given an array of integers of size ‘N’. You have to make the elements of the array equal, and the cost of changing the element ‘x’ to ‘y’ is abs(x -y). Your task is to fin...
- Ans. Brute Force
In this approach, we will traverse the array for each value between the minimum and maximum value of the array. We will find the cost for each value to make the elements of the array equal to that particular value. We will maintain a variable minimumCost that stores the minimum cost from all these costs.
For example, ARR = [2, 16, 11], then we will find the cost needed to convert every element in ...
(5 Questions)
Round duration - 70 minutes
Round difficulty - Medium
The interview started with the interviewer asking me about my projects and why and what I have used in them. Be very clear with all the technologies you have used in your project as the interviewer will ask you in-depth about it.
Explain Components, Modules and Services in Angular. What is a Recursive Stored Procedure?
- Q1. Sub Sort
You are given an integer array ‘ARR’. You have to find the length of the shortest contiguous subarray such that, if you sort this subarray in ascending order, then the whole array will be sorted i...
- Ans. Brute Force
In this approach, we consider every possible subarray that can be formed from the given array ‘ARR’. For every subarray ARR[i … j] considered, we need to check whether this is the smallest unsorted subarray or not.
The algorithm is as follows:
- Let’s take the variable ‘ANS’ equal to 'N' (the length of the array) initially.
- Now for every subarray ARR[i … j], we will find the maximum and minimum value lying ...
- Q2. Minimum Operations
You are given an array 'ARR' of 'N' positive integers. You need to find the minimum number of operations needed to make all elements of the array equal. You can perform a...
- Ans. Brute Force
For making all elements equal you can select a target value and then you can make all elements equal to that. Now, for converting a single element to a target value you can perform a single operation only once. In this manner, you can achieve your task in the maximum of ‘N’ operations but you have to minimize this number of operations and for this, your selection of target is very important because if ...
- Q3. Tower of Hanoi
You are given three rods (numbered 1 to 3), and ‘N’ disks initially placed on the first rod, one on top of each other in increasing order of size ( the largest disk is at the bottom). You ar...
- Ans. Recursive Approach
The idea is to use recursion to solve the problem. Firstly, we will try to solve this problem for N = 2; we can move a disk from rod 1 to rod 2, then move another disk from rod 1 to rod 2, and then move the disk in rod 2 to rod 3, this way we can move all the disks to rod 3. Now, to solve for N = 3, we can first solve the problem for the first two disks and then move the last disk to another rod and t...
- Q4. Technical Questions
Relationships, Scaling, Load Balancing, and few complex queries on SQL Joins.
- Q5. OS Questions
Multithreading and Semaphore.
(1 Question)
Round duration - 30 minutes
Round difficulty - Easy
The interviewer was VP of Engineering at MakeMyTrip with more than 10 years of experience. He asked about the 4 Pillars of OOPS and we had an in-depth discussion with real-life applications for each of them.
- Q1. Square root (decimal)
You have been given two integers 'N' and 'D', Your task is to find the square root of the number 'N' with precision up to 'D' decimal places i.e. the d...
- Ans. Bruteforce
- We will find the integer part and decimal part of the answer separately.
- First, we will find an integral part.
- We will declare the answer variable where we will store the answer.
- Your answer could be between 1 and N so we will iterate through all the numbers from 1 to N.
- Let’s say we are currently at number i.
- If i ^ 2 = N then i is the exact answer so we will return i.
- If i ^ 2 < N then i could be a possible an...
Interview Preparation Tips
Tip 1 : Never lose hope. Just keep working.
Tip 2 : Solve at least 5 problems each day of medium level or 3 questions of hard level with complete understanding.
Tip 3 : Keep at least 3-4 projects in your resume.
Tip 1 : Keep it 1 page.
Tip 2 : Revise it very well before the interview.
Tip 3 : Know your projects in-depth. They might also ask you to show a demo as it is a virtual interview. So, keep them ready before the interview.
Skills evaluated in this interview
Top MakeMyTrip Full Stack Developer Interview Questions and Answers
Full Stack Developer Interview Questions asked at other Companies
I was interviewed in Aug 2021.
(2 Questions)
Round duration - 120 Minutes
Round difficulty - Medium
There were two sections mcq's and coding. We were allowed to switch between sections and there was no specific time for any section. Around 350 students gave the test.
- Q1. Count Inversions
For a given integer array/list 'ARR' of size 'N', find the total number of 'Inversions' that may exist.
An inversion is defined for a pair of integers in the arra...
- Ans. Brute Force Approach
The steps are as follows:
- Initialize a ‘COUNT’ with 0 to keep track of the number of inversions
- Iterate over every element in the array in a linear fashion starting from 0.
- For every element, check all the elements ahead of the current element and check the condition.
- If the condition satisfies, increase the ‘COUNT’ by 1.
- Otherwise, move to the next iteration.
- Return the ‘COUNT’.
- Q2. Maximum Consecutive Ones
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 on...
- Ans. Brute Force approach
The simplest way to find the required subarray would be to consider all the possible subarrays and compare the length at every point and store the longest length. If at any point, the current element is 0 and the value of ‘K’ is greater than 0, use it to convert the current element to 1. Else if the value of K is 0 , iterate further to find the next possible subarray.
Algorithm :
- Loop over...
(3 Questions)
Round duration - 50 Minutes
Round difficulty - Medium
About 45 students were shortlisted for this round. My interview was at 10:15am. I was asked to introduce myself.
- Q1. Maximum Distance
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...
- Ans. 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 ...
- Q2. Left View Of a Binary Tree
You have been given a binary tree of integers. You are supposed to find the left view of the binary tree. The left view of a binary tree is the set of all nodes that are visible ...
- Ans. Preorder Traversal Approach
The idea is to use preorder traversal and for each level of the binary tree include the leftmost node in the answer. In the preorder traversal, we will traverse the left subtree of any node before the right subtree so that all nodes to the left of the current node are visited before the nodes which are on the right of the current node. Hence for any level, we will reach the leftmost node befo...
- Q3. Technical Questions
Then I was asked the following :-.
1) What is polymorphism and abstraction, give examples.
2) What are stateful protocols? Is HTTP stateful or stateless? Difference between http and ...
(1 Question)
Round duration - 40 Minutes
Round difficulty - Easy
About 17 students cleared the first round. My second round was at 4:30pm. The interviewer was very humble.
- Q1. Technical Questions
I introduced myself and then was asked the following :-
1) Polymorphism, operator overloading, whether operator overloading comes under compile time or runtime polymorphism.
2) Diffe...
(1 Question)
Round duration - 20 Minutes
Round difficulty - Easy
This was HR round, 7 students were shortlisted for this round. I received the call after 6:30pm.
- Q1. Basic HR Questions
I was queried the following :-
1) How was my interview experience. How were the interviewers
2) Why MakeMyTrip, give an honest answer.
3) My personal strengths and weaknesses.
4) How ma...
Interview Preparation Tips
Tip 1 : For on campus placements, focus more on core subjects rather than very good projects/internships.
Tip 2 : You must cover all important Data Structures and their important/fundamental questions at least twice. For advanced Data Structures like DP, graph, trees, you should have good practice before hand.
Tip 3 : Solve aptitude questions occasionally.
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 : it should be readable and authentic
Skills evaluated in this interview
Top MakeMyTrip Full Stack Developer Interview Questions and Answers
Full Stack Developer Interview Questions asked at other Companies
Rishika Jaiswal
Selected
I applied via Job Portal and was interviewed before Apr 2023. There was 1 interview round.
(1 Question)
- Q1. Tell me about yourself
Supply Chain Manager Interview Questions asked at other Companies
Top trending discussions
MakeMyTrip Interview FAQs
Some of the top questions asked at the MakeMyTrip interview -
The duration of MakeMyTrip interview process can vary, but typically it takes about less than 2 weeks to complete.
Tell us how to improve this page.
MakeMyTrip Interviews By Designations
- MakeMyTrip Software Developer Interview Questions
- MakeMyTrip Senior Software Engineer Interview Questions
- MakeMyTrip Software Engineer Interview Questions
- MakeMyTrip Holiday Expert Interview Questions
- MakeMyTrip Product Manager Interview Questions
- MakeMyTrip Senior QA Engineer Interview Questions
- MakeMyTrip Full Stack Developer Interview Questions
- MakeMyTrip Senior Software Engineer 2 Interview Questions
- Show more
Interview Questions for Popular Designations
- Software Developer Interview Questions
- Senior Software Engineer Interview Questions
- Software Engineer Interview Questions
- Product Manager Interview Questions
- Holiday Expert Interview Questions
- Senior QA Engineer Interview Questions
- Associate Interview Questions
- Design Engineer Interview Questions
- Show more
MakeMyTrip Interview Process
based on 62 interviews in last 1 year
Interview experience
People are getting interviews through
Interview Questions from Similar Companies
Fast track your campus placements
MakeMyTrip Reviews and Ratings
based on 819 reviews
Rating in categories
2-6 Yrs
₹ 15-26 LPA
6-9 Yrs
₹ 20-27 LPA
1-2 Yrs
₹ 15-18 LPA
|
Senior Software Engineer
309
salaries
|  ₹13.1 L/yr - ₹32 L/yr |
|
Assistant Manager
274
salaries
| ₹4.8 L/yr - ₹18 L/yr |
|
Holiday Expert
229
salaries
| ₹0.6 L/yr - ₹6.9 L/yr |
|
Senior Business Development Manager
224
salaries
| ₹5 L/yr - ₹12 L/yr |
|
Senior Executive
172
salaries
| ₹2 L/yr - ₹9.1 L/yr |
Cleartrip
Yatra
Goibibo
Oyo Rooms
Calculate your in-hand salary
- Home >
- Interviews >
- MakeMyTrip Interview Questions
