i
MakeMyTrip
Filter interviews by
I was interviewed before Feb 2021.
Round duration - 90 minutes
Round difficulty - Medium
Questions on aptitude, English, logical reasoning, C/C++ and 5 coding ques. (only pseudo code).
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).
Let S = “abdd” ...
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...
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 ...
Round duration - 60 minutes
Round difficulty - Easy
Questions based on OOPS were asked in this round.
What is a virtual function?
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
What are the types of polymorphism?
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...
Difference between deep copy and shallow copy
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.
Round duration - 30 minutes
Round difficulty - Easy
HR round with typical behavioral problems.
1. Questions on strengths, weakness and hobbies.
2. What you know about their company apart from ppt ?
3. Discussion on my projects
Make sure you study their website inside-out before you go for interviews, this shows your passion to work for their company. Be yourself.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I was interviewed before Feb 2021.
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
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...
Round duration - 75 minutes
Round difficulty - Medium
It was an online coding test in which 3 coding question were given.
Let S = “abdd” ...
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...
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
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 ...
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
The given linked list is 1 -> 2 -> 3 -> 4-> NULL. Then th...
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...
Port numbers of protocols like FTP,SMTP
Port number 20 is used for FTP data while port number 21 is used for FTP Control.
Port number 161 is used for SMTP.
Explain the OSI Model
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...
How to copy files in Linux ?
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.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I was interviewed before Feb 2021.
Round duration - 60 minutes
Round difficulty - Easy
Technical round with 3 problems based on DSA and Algorithms.
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
The given linked list is 1 -> 2 -> 3 -> 4-> NULL. Then th...
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...
Let S = “abdd” a...
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...
Round duration - 60 minutes
Round difficulty - Easy
Technical round with questions based on OOPS and Angular.
What are the different OOPS concepts?
The building blocks of OOPs are :
1. Classes & Objects : An Object can be defined as an entity that has a state and behavior. Class is basically a collection of objects which act as building blocks.
2. Abstraction : It helps in displaying the essential features without showing the details or the functionality to the user. It avoids unnecessary information or irrelevant details and shows only that specific...
Given two classes C1 and C2 which are almost same.(remember not exactly same). You want to choose best among these classes so that it can be use as key in hash map. What question will you ask ...
What is Lazy Loading? What are its advantages and disadvantages?
Lazy loading is a strategy to identify resources as non-blocking (non-critical) and load these only when needed. It's a way to shorten the length of the critical rendering path, which translates into reduced page load times.Lazy loading can occur on different moments in the application, but it typically happens on some user interactions such as scrolling and navigation.
Advantages of Lazy loading:
1. On-demand loading re...
Round duration - 60 minutes
Round difficulty - Easy
Questions based on System Design, ajax, jquery were asked.
Design a traffic light system.
Tip 1: Firstly, remember that the system design round is extremely open-ended and there’s no such thing as a standard answer. Even for the same question, you’ll have a totally different discussion with different interviewers.
Tip 2:Before you jump into the solution always clarify all the assumptions you’re making at the beginning of the interview. Ask questions to identify the scope of the system. This will clear the in...
How ajax works?
1. An event occurs in a web page (the page is loaded, a button is clicked).
2. An XMLHttpRequest object is created by JavaScript.
3. The XMLHttpRequest object sends a request to a web server.
4. The server processes the request.
5. The server sends a response back to the web page.
6. The response is read by JavaScript.
7. Proper action (like page update) is performed by JavaScript.
Difference between angular js and jquery.
1. jQuery is a Java script-based library. Angular is a Typescript-based, front-end development framework.
2. jQuery is used for DOM manipulation. Angular is used for creating single-page applications.
3. jQuery is suitable for small size projects. Angular is suitable for large, complex projects.
4. jQuery is simple and easy to learn. Angular is comparatively tougher to comprehend.
5. jQuery is unidirectional. Angular...
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
MakeMyTrip interview questions for popular designations
Get interview-ready with Top MakeMyTrip Interview Questions
Function overloading and overriding are concepts in object-oriented programming that involve the use of multiple functions with the same name.
Function overloading refers to the ability to have multiple functions with the same name but different parameters in a class.
Function overriding refers to the ability to have a derived class provide a different implementation of a method that is already defined in its base class.
...
I want to join MakeMyTrip because of its strong reputation in the travel industry and its commitment to providing exceptional customer service.
MakeMyTrip is a well-established and reputable company in the travel industry.
I am impressed by MakeMyTrip's commitment to providing exceptional customer service.
I believe joining MakeMyTrip will provide me with valuable opportunities for professional growth and development.
I am...
Reverse a linked list in groups of n
Create a function that takes a linked list and a group size as input
Iterate through the linked list, reversing each group of nodes
Keep track of the previous and current node to update the pointers
Handle cases where the group size is larger than the remaining nodes
Return the head of the reversed linked list
Reverse the second half of a linked list efficiently.
Find the middle node of the linked list
Reverse the second half of the linked list using a pointer
Update the pointers to connect the reversed second half with the first half
Top trending discussions
Interview experience
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