MakeMyTrip Interview Questions, Process, and Tips for Freshers

It was Conducted on Hacker Earth, There were 2 coding questions and 20 mcq's. Both Coding questions were of medium level and also basic mcq's

Q1. 2 coding questions of link list were asked and one problem statement was given in which only approach was asked to be given as it was complex to implement during the limited time frame of 1 hour.
Add your answer

Q1. DBMS, OS in depth was asked and Some questions of Networking were also asked. For DBMS questions on Indexing, B ,B+ Trees, Normalization based on real life scenario's were asked and from OS all types of CP...read more
Add your answer

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...read more
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...read more
Answered by CodingNinjas
View 1 more answer
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...read more
Ans. SUCCESSOR
When we delete a node, three possibilities arise:
 
1. Node to be deleted is a leaf node: Simply remove it from the tree.
2. Node to be deleted has only one child: Copy that child to the node and delete the child.
3. 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...read more
Answered by CodingNinjas
View 1 more answer

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 ...read more
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...read more
Answered by CodingNinjas
View 1 more answer
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...read more
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.
Space Complexity: O(1)Explanation:
O(1).
 
Constant extra space is required.
Time Complexity: O...read more
Answered by CodingNinjas
View 2 more answers
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...read more
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...read more
Answered by CodingNinjas
View 1 more answer

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.
Add your answer
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 ...read more
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 ...read more
Answered by CodingNinjas
View 2 more answers
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...read more
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 :
 
1. Create a variable (say, ‘maxSum’) and initialise it to 0.
2. Run a loop from 0 to 'N - 1' (say, iterat...read more
Answered by CodingNinjas
View 1 more answer

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...read more
Ans. Brute Force Approach
The steps are as follows:
 
1. Initialize a ‘COUNT’ with 0 to keep track of the number of inversions
2. Iterate over every element in the array in a linear fashion starting from 0.
3. For every element, check all the elements ahead of the current element and check the condition.
   1. If the condition satisfies, increase the ‘COUNT’ by 1.
   2. Otherwise, move to the next iteration.
4. Return the ‘COUNT’.
Space Complexity: O(...read more
Answered by CodingNinjas
View 2 more answers
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...read more
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 : 
1. Loop over...read more
Answered by CodingNinjas
View 2 more answers

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...read more
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 ...read more
Answered by CodingNinjas
Add your answer
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 ...read more
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...read more
Answered by CodingNinjas
View 1 more answer
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 ...read more
Add your answer

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...read more
Add your answer

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...read more
Add your answer