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

Q1. Smallest window in a string containing all the characters of another string.(GFG)
Ans. 
Find the smallest window in a string containing all characters of another string.
• Use a sliding window approach to find the smallest window

• Create a frequency map of characters in the second string

• Slide the window and update the frequency map until all characters are found

• Track the minimum window size and indices
Answered by AI
View 1 more answer
Q2. Check whether linked list is Pallindrome or not
Ans. 
To check if a linked list is a palindrome, compare the first half of the list with the reversed second half.
• Traverse the linked list to find the middle element using slow and fast pointers.

• Reverse the second half of the linked list.

• Compare the first half with the reversed second half to check for palindrome.
Answered by AI
Add your answer
Q3. Deadlocks,4 conditions of Deadlocks and ways of preventing Deadlock
Ans. 
Deadlocks occur when two or more processes are waiting for each other to release resources, leading to a standstill.
• 4 conditions of Deadlocks: mutual exclusion, hold and wait, no preemption, circular wait

• Preventing Deadlocks: using a proper resource allocation strategy, implementing timeouts, avoiding circular wait, using deadlock detection and recovery algorithms

• Example: Two processes each holding a resource and waiti...read more
Answered by AI
Add your answer

Q1. Algorithm to find if any 5 numbers add up to the value of the Sum
Ans. 
Use a hash set to store seen numbers and check if the complement of current number is in the set.
• Iterate through the array and for each number, check if the complement of the current number is in the hash set.

• If the complement is found, return true. Otherwise, add the current number to the hash set.

• Repeat this process for all numbers in the array.

• Example: Array [1, 2, 3, 4, 5] and Sum 9 should return true as 4 + 5 = 9.
Answered by AI
Add your answer
Q2. What is DNS(Domain Name System)
Ans. 
DNS is a system that translates domain names to IP addresses, allowing users to access websites using human-readable names.
• DNS is like a phone book for the internet, translating domain names (e.g. google.com) to IP addresses (e.g. 172.217.3.206).

• DNS servers store records that map domain names to IP addresses, helping users navigate the internet.

• DNS also helps with email delivery by translating domain names in email add
Answered by AI
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 Problem Statement
Bob and his wife are in the famous 'Arcade' mall in the city of Berland. This mall has a unique way of moving between shops using trampolines. Each shop is laid out in a st...read more
Ans. 
Find the minimum number of trampoline jumps Bob needs to make to reach the final shop, or return -1 if it's impossible.
• Use Breadth First Search (BFS) algorithm to find the minimum number of jumps required.

• Keep track of the visited shops to avoid revisiting them.

• If a shop has an Arr value of 0, it is impossible to reach the final shop.

• Return -1 if the final shop cannot be reached.
Answered by AI
Add your answer
Q2. 
Smallest Window Problem Statement
Given two strings, S and X, your task is to find the smallest substring in S that contains all the characters present in X.
Example:
Input:
S = "abdd", X = "bd"
Outpu...read more
Ans. 
Find the smallest substring in S that contains all characters in X.
• Use a sliding window approach to find the smallest window in S containing all characters of X.

• Maintain a hashmap to keep track of characters in X and their frequencies in the current window.

• Slide the window to the right, updating the hashmap and shrinking the window until all characters in X are present.

• Return the smallest window found.

• Example: S = 'abd
Answered by AI
Add your answer
Q3. 
Rat in a Maze Problem Statement
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...read more
Ans. 
Find all possible paths for a rat in a maze from start to destination.
• Use backtracking to explore all possible paths in the maze.

• Keep track of visited cells to avoid revisiting them.

• Return paths in alphabetical order as a list of strings.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Questions based on OOPS were asked in this round.

Q1. What is a virtual function?
Ans. 
A virtual function is a function in a base class that is declared using the keyword 'virtual' and can be overridden by a function with the same signature in a derived class.
• Virtual functions allow for dynamic polymorphism in C++

• They are used in inheritance to achieve runtime polymorphism

• Virtual functions are declared in a base class and can be overridden in derived classes

• They are called based on the type of object bei...read more
Answered by AI
Add your answer
Q2. What are the types of polymorphism in Object-Oriented Programming?
Ans. 
Types of polymorphism in OOP include compile-time (method overloading) and runtime (method overriding) polymorphism.
• Compile-time polymorphism is achieved through method overloading, where multiple methods have the same name but different parameters.

• Runtime polymorphism is achieved through method overriding, where a subclass provides a specific implementation of a method that is already defined in its superclass.

• Polymor...read more
Answered by AI
Add your answer
Q3. What is the difference between deep copy and shallow copy?
Ans. 
Deep copy creates a new object and recursively copies all nested objects, while shallow copy creates a new object and copies only the references to nested objects.
• Deep copy creates a new object and copies all nested objects, while shallow copy creates a new object and copies only the references to nested objects.

• In deep copy, changes made to the original object do not affect the copied object, while in shallow copy, ch...read more
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

HR round with typical behavioral problems.