AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
MakeMyTrip
Compare
Filter interviews by
MakeMyTrip Interview Questions and Answers for Freshers
15 Interview questions
Understanding how the role functions and the responsibilities involved.
The role involves providing support to customers, addressing their queries and concerns.
Requires strong communication skills to effectively interact with customers.
Involves troubleshooting technical issues and providing solutions.
May require working in a team to ensure customer satisfaction.
Understanding company products/services to better assi...
Merge two strings diagonally in a Java array of strings.
Iterate through each row and column to merge characters diagonally
Keep track of the diagonal position to insert characters from both strings
Handle cases where strings have different lengths
Example: String 1: 'hello', String 2: 'world', Merged: 'hweolrllod'
Example: String 1: 'abc', String 2: '123', Merged: 'a1b2c3'
To debug a 500 error, check server logs, review code changes, test API endpoints, and use debugging tools.
Check server logs for error details
Review recent code changes that may have caused the error
Test API endpoints using tools like Postman
Use debugging tools like Chrome DevTools or Firebug
Merge two sorted linked lists into one sorted linked list.
Define a new linked list to store the merged result.
Use two pointers to traverse both linked lists.
Compare the current nodes of both lists and append the smaller one to the merged list.
Continue until all nodes from both lists are processed.
Example: Merging 1->3->5 and 2->4->6 results in 1->2->3->4->5->6.
Shortest Path in a Binary Matrix Problem Statement
Given a binary matrix of size N * M where each element is either 0 or 1, find the shortest path from a source cell to a destination cell, consisting only ...
Find the shortest path in a binary matrix from a source cell to a destination cell consisting only of 1s.
Use Breadth First Search (BFS) algorithm to find the shortest path.
Keep track of visited cells to avoid revisiting them.
Calculate the path length by counting the number of 1s in the path.
Handle edge cases such as invalid inputs and unreachable destination.
Validate Binary Search Tree (BST)
You are given a binary tree with 'N' integer nodes. Your task is to determine whether this binary tree is a Binary Search Tree (BST).
BST Definition:
A Binary Search Tre...
Validate if a given binary tree is a Binary Search Tree (BST) or not.
Check if the left subtree of a node contains only nodes with data less than the node's data.
Check if the right subtree of a node contains only nodes with data greater than the node's data.
Ensure that both the left and right subtrees are also binary search trees.
Traverse the tree in an inorder manner and check if the elements are in sorted order.
R...
Delete Node in Binary Search Tree Problem Statement
You are provided with a Binary Search Tree (BST) containing 'N' nodes with integer data. Your task is to remove a given node from this BST.
A BST is a b...
Implement a function to delete a node from a Binary Search Tree and return the inorder traversal of the modified BST.
Understand the properties of a Binary Search Tree (BST) - left subtree contains nodes with data less than the node, right subtree contains nodes with data greater than the node.
Implement a function to delete the given node from the BST while maintaining the BST properties.
Perform inorder traversal o...
Reach the Destination Problem Statement
You are given a source point (sx, sy) and a destination point (dx, dy). Determine if it is possible to reach the destination point using only the following valid mov...
The problem involves determining if it is possible to reach a destination point from a source point using specified moves.
Iterate through each test case and check if destination is reachable from source using specified moves
Implement a recursive function to explore all possible paths from source to destination
Keep track of visited points to avoid infinite loops
Return true if destination is reachable, false otherwi...
Longest Duplicate Substring Problem Statement
You are provided with a string 'S'. The task is to determine the length of the longest duplicate substring within this string. Note that duplicate substrings c...
Find the length of the longest duplicate substring in a given string.
Iterate through all possible substrings of the input string.
Use a rolling hash function to efficiently compare substrings.
Store the lengths of duplicate substrings and return the maximum length.
Maximum Sum of Products for Array Rotations
You are given an array ARR consisting of N elements. Your task is to determine the maximum value of the summation of i * ARR[i] among all possible rotations of A...
Find the maximum sum of products for array rotations.
Iterate through all possible rotations of the array and calculate the sum of products for each rotation.
Keep track of the maximum sum of products found so far.
Return the maximum sum of products obtained.
MakeMyTrip Interview Experiences for Freshers
8 interviews found
Anonymous
(3 Questions)
- Q1. Api status codes, api debugging questions
- Q2. If you get 500 error how to debug.
- Ans.
To debug a 500 error, check server logs, review code changes, test API endpoints, and use debugging tools.
Check server logs for error details
Review recent code changes that may have caused the error
Test API endpoints using tools like Postman
Use debugging tools like Chrome DevTools or Firebug
- Q3. One java string question merge two strings diagonally.
- Ans.
Merge two strings diagonally in a Java array of strings.
Iterate through each row and column to merge characters diagonally
Keep track of the diagonal position to insert characters from both strings
Handle cases where strings have different lengths
Example: String 1: 'hello', String 2: 'world', Merged: 'hweolrllod'
Example: String 1: 'abc', String 2: '123', Merged: 'a1b2c3'
Skills evaluated in this interview
Selected
I applied via Referral and was interviewed in Sep 2024. There was 1 interview round.
Java arrays string easy to medium questions
Selected
I applied via Approached by Company and was interviewed in Nov 2023. There were 3 interview rounds.
Linked list, tree, queues
(3 Questions)
- Q1. Merge linked list
- Q2. Minimum jump question
- Q3. Coin switch problem
- Ans.
Coin switch problem involves determining the minimum number of coin flips to make all coins face the same direction.
Start from one end and count the number of flips needed to make all coins face the same direction
Consider the edge cases where the first and last coins are different
Optimize by flipping only when necessary
(1 Question)
- Q1. Salary discussion
Selected
I applied via Walk-in and was interviewed before Sep 2023. There were 3 interview rounds.
(2 Questions)
- Q1. Tell me About your self
- Ans.
Experienced customer support executive with a strong background in resolving complex issues and providing exceptional service.
Over 5 years of experience in customer support roles
Skilled in handling escalated customer complaints and finding solutions
Proficient in using CRM systems and ticketing platforms
Excellent communication and problem-solving skills
Received multiple awards for outstanding customer service
- Q2. Tell me about your work experience
- Ans.
I have over 5 years of experience in customer support roles, handling various customer inquiries and issues.
Managed customer support tickets through CRM system
Provided technical support for software products
Resolved customer complaints and issues in a timely manner
Trained new customer support representatives
Implemented customer satisfaction surveys to gather feedback
(2 Questions)
- Q1. What do you about this project
- Q2. Do you have any idea how is it working
- Ans.
Understanding how the role functions and the responsibilities involved.
The role involves providing support to customers, addressing their queries and concerns.
Requires strong communication skills to effectively interact with customers.
Involves troubleshooting technical issues and providing solutions.
May require working in a team to ensure customer satisfaction.
Understanding company products/services to better assist cu...
Discuss about job and all other parts
I applied via Campus Placement and was interviewed in Jul 2022. There were 3 interview rounds.
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
(1 Question)
- 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.
(1 Question)
- 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...
Interview Preparation Tips
I applied via Referral and was interviewed in May 2022. There were 3 interview rounds.
(1 Question)
- Q1. Total 3 rounds Just be prepared with all your previous projects (college as well as previous companies) with good understanding of networking, OS and Web concepts. Apart from this, rest questions depends ...
(1 Question)
- Q1. As discussed in previous round...All rounds will be mostly similar, apart from last round with Director/VP as they may ask basic behavioural and situational questions as well.
Interview Preparation Tips
I appeared for an interview in Sep 2021.
(2 Questions)
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 Problem Statement
You are given a source point (sx, sy) and a destination point (dx, dy). Determine if it is possible to reach the destination point using only the following valid mo...
- Ans.
The problem involves determining if it is possible to reach a destination point from a source point using specified moves.
Iterate through each test case and check if destination is reachable from source using specified moves
Implement a recursive function to explore all possible paths from source to destination
Keep track of visited points to avoid infinite loops
Return true if destination is reachable, false otherwise
- Q2.
Delete Node in Binary Search Tree Problem Statement
You are provided with a Binary Search Tree (BST) containing 'N' nodes with integer data. Your task is to remove a given node from this BST.
A BST is a ...
- Ans.
Implement a function to delete a node from a Binary Search Tree and return the inorder traversal of the modified BST.
Understand the properties of a Binary Search Tree (BST) - left subtree contains nodes with data less than the node, right subtree contains nodes with data greater than the node.
Implement a function to delete the given node from the BST while maintaining the BST properties.
Perform inorder traversal of the...
(3 Questions)
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 Problem Statement
Given a binary matrix of size
N * Mwhere each element is either 0 or 1, find the shortest path from a source cell to a destination cell, consisting only... - Ans.
Find the shortest path in a binary matrix from a source cell to a destination cell consisting only of 1s.
Use Breadth First Search (BFS) algorithm to find the shortest path.
Keep track of visited cells to avoid revisiting them.
Calculate the path length by counting the number of 1s in the path.
Handle edge cases such as invalid inputs and unreachable destination.
- Q2.
Pair Sum Problem Statement
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Note:
... - Ans.
Given an array of integers and a target sum, find all pairs of elements that add up to the target sum.
Use a hashmap to store the difference between the target sum and each element as keys and their indices as values.
Iterate through the array and check if the current element's complement exists in the hashmap.
Return the pairs of elements that add up to the target sum in sorted order.
- Q3.
Validate Binary Search Tree (BST)
You are given a binary tree with 'N' integer nodes. Your task is to determine whether this binary tree is a Binary Search Tree (BST).
BST Definition:
A Binary Search Tr...
- Ans.
Validate if a given binary tree is a Binary Search Tree (BST) or not.
Check if the left subtree of a node contains only nodes with data less than the node's data.
Check if the right subtree of a node contains only nodes with data greater than the node's data.
Ensure that both the left and right subtrees are also binary search trees.
Traverse the tree in an inorder manner and check if the elements are in sorted order.
Recurs...
(2 Questions)
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.
Longest Duplicate Substring Problem Statement
You are provided with a string 'S'. The task is to determine the length of the longest duplicate substring within this string. Note that duplicate substrings ...
- Ans.
Find the length of the longest duplicate substring in a given string.
Iterate through all possible substrings of the input string.
Use a rolling hash function to efficiently compare substrings.
Store the lengths of duplicate substrings and return the maximum length.
- Q2.
Maximum Sum of Products for Array Rotations
You are given an array
ARRconsisting ofNelements. Your task is to determine the maximum value of the summation ofi * ARR[i]among all possible rotations of... - Ans.
Find the maximum sum of products for array rotations.
Iterate through all possible rotations of the array and calculate the sum of products for each rotation.
Keep track of the maximum sum of products found so far.
Return the maximum sum of products obtained.
Interview Preparation Tips
Tip 1 : DSA should be very very good.
Tip 2 : Computer Science Fundamentals are very important
Tip 3 : Think out loud in an interview
Tip 1 : At least 2 very well prepared projects
Tip 2 : Internship experiences always help
Skills evaluated in this interview
I appeared for an interview in Aug 2021.
(2 Questions)
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 Problem Statement
Given an integer array
ARRof sizeN, your task is to find the total number of inversions that exist in the array.An inversion is defined for a pair of integers in the...
- Ans.
Count the total number of inversions in an integer array.
Iterate through the array and for each pair of elements, check if the inversion condition is met.
Use a nested loop to compare each pair of elements efficiently.
Keep a count of the inversions found and return the total count at the end.
- Q2.
Maximum Consecutive Ones Problem Statement
Given a binary array 'ARR' of size 'N', your task is to determine the maximum length of a sequence consisting solely of 1’s that can be obtained by converting at...
- Ans.
Find the maximum length of a sequence of 1's by converting at most K zeroes into ones in a binary array.
Iterate through the array and keep track of the current window of 1's and zeroes.
Use a sliding window approach to find the maximum length of the sequence.
Update the window by flipping zeroes to ones within the limit of K flips.
Return the maximum length of the sequence obtained.
(2 Questions)
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 Problem Statement
Given an integer array 'A' of size N, your task is to find the maximum value of j - i, with the restriction that A[i] <= A[j], where 'i' and 'j' are indices of the ar...
- Ans.
Find the maximum distance between two elements in an array where the element at the first index is less than or equal to the element at the second index.
Iterate through the array and keep track of the minimum element encountered so far along with its index.
Calculate the maximum distance by subtracting the current index from the index of the minimum element.
Update the maximum distance if a greater distance is found whil...
- Q2.
Determine the Left View of a Binary Tree
You are given a binary tree of integers. Your task is to determine the left view of the binary tree. The left view consists of nodes that are visible when the tree...
- Ans.
The task is to determine the left view of a binary tree, which consists of nodes visible when viewed from the left side.
Traverse the binary tree level by level from left to right, keeping track of the first node encountered at each level.
Use a queue to perform level order traversal and keep track of the level number for each node.
Store the first node encountered at each level in a result array to get the left view of t...
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.
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.
Interview Preparation Tips
Tip 1 : For on campus placements, focus more on core subjects rather than very good projects/internships.
Tip 2 : You must cover all important Data Structures and their important/fundamental questions at least twice. For advanced Data Structures like DP, graph, trees, you should have good practice before hand.
Tip 3 : Solve aptitude questions occasionally.
Tip 1 : Don't put too much skills/projects if you are not confident about it, u need not have very rich resume during on campus placements
Tip 2 : it should be readable and authentic
Skills evaluated in this interview
Top trending discussions
Interview questions from similar companies
I appeared for an interview before Dec 2015.
Interview Questionnaire
2 Questions
- Q1. 1 question from basic data structures and algorithms The question was similar to the one in the given link- -----/
- Q2. Why do you want to join the company?
- Ans.
I am excited to join the company because of its reputation for innovation and commitment to employee growth.
I am impressed by the company's track record of developing cutting-edge software solutions.
I appreciate the company's focus on fostering a culture of learning and development.
I am excited about the opportunity to work with a talented team of developers and contribute to the company's success.
I believe that the co...
Interview Preparation Tips
Experience: Resumes were shortlisted with a short aptitude round where we are asked basic questions about databases, basic programming(C and C ++ questions)
Round: Technical Interview
Experience: The questions were asked were simple - related to arrays and data structures. Some questions were asked regarding my resume and projects.
Tips: Be thorough with geeksForGeeks, and your projects.
Round: HR Interview
Experience: I told him how I found the story of the founder of Infoedge very inspiring.
Tips: This round should be more simpler , be prepared with why you want to join the company and general HR questions
Skills: Basic C/C++, Programming Skills In Any Language Like C
College Name: IIIT Allahabad
Interview Preparation Tips
Experience: Ques will be based on arrays( duplicate element, missing element in 1 to n array), link list(reverse, remove loop, middle node etc), Hashing, sql join, normalisation, indexing in sql, singlton pattern and sorting and searching.
Tips: Focus will remain on algorithms. Whatever program they will ask to write, they will also ask to optimize the solution.
Skill Tips: Puzzle on mislabled jar, odd weight ball. As I had exp in Java, so some more que on Java, java script and web technology. All you need in interview is to be confident and show your interest in web domain.
Skills: Java, Data structure, Algorithm
College Name: NA
MakeMyTrip Interview FAQs
The duration of MakeMyTrip interview process can vary, but typically it takes about less than 2 weeks to complete.
Tell us how to improve this page.
MakeMyTrip Interviews By Designations
- MakeMyTrip Software Developer Interview Questions
- MakeMyTrip Senior Software Engineer Interview Questions
- MakeMyTrip Software Engineer Interview Questions
- MakeMyTrip Product Manager Interview Questions
- MakeMyTrip Holiday Expert Interview Questions
- MakeMyTrip Senior QA Engineer Interview Questions
- MakeMyTrip Senior Business Development Manager Interview Questions
- MakeMyTrip Full Stack Developer Interview Questions
- Show more
Interview Questions for Popular Designations
- Software Developer Interview Questions
- Senior Software Engineer Interview Questions
- Software Engineer Interview Questions
- Product Manager Interview Questions
- Holiday Expert Interview Questions
- Senior QA Engineer Interview Questions
- Executive Interview Questions
- Associate Software Engineer Interview Questions
- Show more
Overall Interview Experience Rating
based on 4 interview experiences
Difficulty level
Duration
Interview Questions from Similar Companies
MakeMyTrip Reviews and Ratings
based on 928 reviews
Rating in categories
5-8 Yrs
Not Disclosed
4-6 Yrs
Not Disclosed
|
Senior Software Engineer
335
salaries
|  ₹19 L/yr - ₹33 L/yr |
|
Assistant Manager
286
salaries
| ₹9 L/yr - ₹16.8 L/yr |
|
Software Engineer
255
salaries
| ₹12.6 L/yr - ₹23 L/yr |
|
Holiday Expert
235
salaries
| ₹2 L/yr - ₹6.1 L/yr |
|
Senior Business Development Manager
221
salaries
| ₹5.4 L/yr - ₹11.7 L/yr |
Cleartrip
Amazon
Flipkart
Indiamart Intermesh
- Home >
- Interviews >
- MakeMyTrip Interview Questions >
- MakeMyTrip Interview Questions for Fresher
