MakeMyTrip Software Developer Interview Questions, Process, and Tips

Q1. Javascript core concepts, output questions
Add your answer

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 - 90 minutes
Round difficulty - Medium

Questions on aptitude, English, logical reasoning, C/C++ and 5 coding ques. (only pseudo code).

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 famous mall in Berland. It has a very ...read more
Ans. 
It can be solved by using mathematics. If the height of wall is less than or equal to x, only one jump is required. Otherwise run a while loop while height is greater than x, and calculate the jumps required by updating the height to height of wall – (climb up-climb down).
Answered by CodingNinjas
View 4 more answers
Q2. Smallest Window
You are given two strings S and X containing random characters. Your task is to find the smallest substring in S which contains all the characters present in X.
Example:
Let S = “abdd” ...read more
Ans. 
The naïve approach is to generate all substrings of string1 and for each substring, check whether the substring contains all characters of string2. Finally, print the smallest substring containing all characters of string2.

The efficient solution is to use hashing. First check if the length of the string is less than the length of the given pattern, if yes then no such window can exist . Next, store the occurrence of ch...read more
Answered by CodingNinjas
View 2 more answers
Q3. Rat In A Maze
You are given a starting position for a rat which is stuck in a maze at an initial point (0, 0) (the maze can be thought of as a 2-dimensional plane). The maze would be given in the form of a...read more
Ans. 
Steps: 
1. Start from the cell[0,0] and look for the valid moves through the adjacent cells in the order Down->Left->Right->Up in the grid.
2. If the move is possible, then move to that cell while storing the character corresponding to the move(D,L,R,U) and again start looking for the valid move until the last cell [n-1,n-1] is reached.
3. Along with it, keep on marking the cells as visited and when all the ...read more
Answered by CodingNinjas
View 1 more answer

Round duration - 60 minutes
Round difficulty - Easy

Questions based on OOPS were asked in this round.

Q1. OOPS Question
What is a virtual function?
Ans. 
A C++ virtual function is a member function in the base class that you redefine in a derived class. It is declared using the virtual keyword. It is used to tell the compiler to perform dynamic linkage or late binding on the function. A 'virtual' is a keyword preceding the normal declaration of a function. When the function is made virtual, C++ determines which function is to be invoked at the runtime based on the type
Answered by CodingNinjas
Add your answer
Q2. OOPS Question
What are the types of polymorphism?
Ans. 
Polymorphism is of two types :
1. Compile Time Polymorphism : 
Invokes the overloaded functions by matching the number and type of arguments. The information is present during compile-time. This means the C++ compiler will select the right function at compile time. It is achieved through function overloading and operator overloading.
2. Run Time Polymorphism : 
This happens when an object’s method is called durin...read more
Answered by CodingNinjas
Add your answer
Q3. OOPS Question
Difference between deep copy and shallow copy
Ans. 
A shallow copy of a collection is a copy of the collection structure, not the elements. With a shallow copy, two collections now share the individual elements.
Deep copies duplicate everything. A deep copy of a collection is two collections with all of the elements in the original collection duplicated.
Answered by CodingNinjas
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

HR round with typical behavioral problems.

Q1. Basic HR Questions
1. Questions on strengths, weakness and hobbies.
2. What you know about their company apart from ppt ?
3. Discussion on my projects
Ans. 
Make sure you study their website inside-out before you go for interviews, this shows your passion to work for their company. Be yourself.
Answered by CodingNinjas
Add your answer

Round duration - 65 minutes
Round difficulty - Easy

There were 2 sections – 
Aptitude and Logical Reasoning and MCQ based on Java question ,C++, coding for 20 min and 45 min respectively.
Section A- Not very difficult to clear this round although less time was a problem.
Section B- It contains 15 multiple choice question on c/c++,java and 4 simple coding questions

Q1. Cycle Detection in a Singly Linked List
You have given a Singly Linked List of integers, determine if it forms a cycle or not.
A cycle occurs when a node's next points back to a previous node in the ...read more
Ans. 
Floyd's algorithm can be used to solve this question.
Define two pointers slow and fast. Both point to the head node, fast is twice as fast as slow. There will be no cycle if it reaches the end. Otherwise, it will eventually catch up to the slow pointer somewhere in the cycle.
Let X be the distance from the first node to the node where the cycle begins, and let X+Y be the distance the slow pointer travels. To catch up, t...read more
Answered by CodingNinjas
View 3 more answers

Round duration - 75 minutes
Round difficulty - Medium

It was an online coding test in which 3 coding question were given.

Q1. Smallest Window
You are given two strings S and X containing random characters. Your task is to find the smallest substring in S which contains all the characters present in X.
Example:
Let S = “abdd” ...read more
Ans. 
The naïve approach is to generate all substrings of string1 and for each substring, check whether the substring contains all characters of string2. Finally, print the smallest substring containing all characters of string2.

The efficient solution is to use hashing. First check if the length of the string is less than the length of the given pattern, if yes then no such window can exist . Next, store the occurrence of ch...read more
Answered by CodingNinjas
View 2 more answers
Q2. Find Smallest Integer
You are given an array 'ARR' consisting of 'N' positive numbers and sorted in non-decreasing order, and your task is to find the smallest positive integer value that c...read more
Ans. 
The Brute force approach would be to find the sum of all the possible subsets and then compare sum with the sum of remaining elements.
A better approach would be to sort the array in descending order and then take the largest elements. Now, take elements from the largest, until we get strictly more than half of total sum of the given array. As soon as the current sum is greater than half of the total sum of the given ar
Answered by CodingNinjas
View 2 more answers
Q3. Minimum steps to reach target by a Knight
You have been given a square chessboard of size ‘N x N’. The position coordinates of the Knight and the position coordinates of the target are also given.
Your t...read more
Ans. 
This problem is similar to finding the shortest path in an unweighted graph. BFS can be used to solve this problem. 
Make a queue that stores the coordinate and distance from its starting node for each cell. Try all 8 possible positions where a Knight can reach from its position. If reachable position is not already visited and is inside the board, we push this state into queue with distance 1 more than its parent ...read more
Answered by CodingNinjas
View 2 more answers

Round duration - 60 minutes
Round difficulty - Easy

It started with a discussion on the programs given in coding round. They asked me about my interest field after that they directly jumped into Networking, Linux and Ethical Hacking part looking my interest domain. They asked me various question on networking and linux.
Then they asked me to code a simple c program

Q1. Reverse Linked List
Given a singly linked list of integers. Your task is to return the head of the reversed linked list.
For example:
The given linked list is 1 -> 2 -> 3 -> 4-> NULL. Then th...read more
Ans. 
This can be solved both: recursively and iteratively.
The recursive approach is more intuitive. First reverse all the nodes after head. Then we need to set head to be the final node in the reversed list. We simply set its next node in the original list (head -> next) to point to it and sets its next to NULL. The recursive approach has a O(N) time complexity and auxiliary space complexity.
For solving the question is c...read more
Answered by CodingNinjas
View 5 more answers
Q2. Networking Question
Port numbers of protocols like FTP,SMTP
Ans. 
Port number 20 is used for FTP data while port number 21 is used for FTP Control.
Port number 161 is used for SMTP.
Answered by CodingNinjas
Add your answer
Q3. Networking Question
Explain the OSI Model
Ans. 
Physical Layer
The lowest layer of the OSI Model is concerned with electrically or optically transmitting raw unstructured data bits across the network from the physical layer of the sending device to the physical layer of the receiving device. It can include specifications such as voltages, pin layout, cabling, and radio frequencies.

Data Link Layer
At the data link layer, directly connected nodes are used to perform nod...read more
Answered by CodingNinjas
Add your answer
Q4. OS Question
How to copy files in Linux ?
Ans. 
The cp command is the primary method for copying files and directories in Linux. Virtually all Linux distributions can use cp. The basic format of the command is: cp [additional_option] source_file target_file
For example:
cp my_file.txt my_file2.txt
This Linux command creates a copy of the my_file.txt file and renames the new file to my_file2.txt.
Answered by CodingNinjas
Add your answer