MakeMyTrip Software Developer Interview Questions, Process, and Tips

Round duration - 60 minutes
Round difficulty - Easy

Technical round with 3 problems based on DSA and Algorithms.

Q1. 
Smallest Integer Not Representable as Subset Sum
Given a non-decreasing sorted array ARR of N positive numbers, determine the smallest positive integer that cannot be expressed as the sum of elements from...read more
Ans. 
Find the smallest positive integer that cannot be expressed as the sum of elements from any proper subset of a given array.
• Sort the array in non-decreasing order.

• Iterate through the array and keep track of the smallest sum that can be formed.

• If the next element in the array is greater than the current sum + 1, then the answer is the current sum + 1.

• Return the answer as the smallest integer not representable as a subset
Answered by AI
Add your answer
Q2. 
Reverse Linked List Problem Statement
Given a singly linked list of integers, return the head of the reversed linked list.
Example:
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link...read more
Ans. 
Reverse a singly linked list of integers and return the head of the reversed linked list.
• Iterate through the linked list and reverse the pointers to point to the previous node instead of the next node.

• Use three pointers to keep track of the current, previous, and next nodes while reversing the linked list.

• Update the head of the reversed linked list to be the last node encountered during the reversal process.
Answered by AI
Add your answer
Q3. 
Smallest Window Problem Statement
Given two strings S and X containing random characters, the task is to find the smallest substring in S which contains all the characters present in X.
Input:
The first...read more
Ans. 
The task is to find the smallest substring in string S which contains all the characters present in string X.
• Iterate through string S and keep track of characters in X using a hashmap

• Use two pointers to maintain a sliding window and find the smallest window containing all characters in X

• Return the smallest window found
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Technical round with questions based on OOPS and Angular.

Q1. What are the different OOP concepts?
Ans. 
OOP concepts include inheritance, encapsulation, polymorphism, and abstraction.
• Inheritance allows a class to inherit properties and behavior from another class.

• Encapsulation restricts access to certain components of an object, protecting its integrity.

• Polymorphism allows objects to be treated as instances of their parent class.

• Abstraction hides the complex implementation details of an object and only shows the necessar
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Questions based on System Design, ajax, jquery were asked.

Q1. How would you design a traffic light system?
Ans. 
Designing a traffic light system involves creating a system that controls the flow of traffic at intersections.
• Divide the traffic light system into three main lights: red, yellow, and green.

• Implement timers to control the duration of each light.

• Include sensors to detect the presence of vehicles and pedestrians.

• Consider implementing a pedestrian crossing signal.

• Integrate a central control system to coordinate the timing
Answered by AI
Add your answer
Q2. How does AJAX work?
Ans. 
AJAX allows for asynchronous communication between client and server without needing to reload the entire page.
• AJAX stands for Asynchronous JavaScript and XML.

• It allows for sending and receiving data from a server without reloading the entire page.

• AJAX uses XMLHttpRequest object to make requests to the server.

• It can update parts of a web page without requiring a full page reload.

• Commonly used in web applications to pro
Answered by AI
Add your answer
Q3. What is the difference between AngularJS and jQuery?
Ans. 
AngularJS is a full-fledged MVC framework for building dynamic web applications, while jQuery is a lightweight library for DOM manipulation and event handling.
• AngularJS is a full-fledged MVC framework, providing features like two-way data binding, dependency injection, and routing.

• jQuery is a lightweight library primarily used for DOM manipulation and event handling.

• AngularJS is suitable for building single-page applic...read more
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.