i
MakeMyTrip
Filter interviews by
I applied via Approached by Company and was interviewed in Nov 2024. There was 1 interview round.
Design a stack that supports push, pop, top, and retrieving minimum element in constant time.
Use two stacks - one to store the actual elements and another to store the minimum values encountered so far
When pushing an element, check if it is smaller than the current minimum and if so, push it to the minimum stack
When popping an element, check if it is the current minimum and if so, pop from the minimum stack as well
Top ...
Find the maximum circular subarray sum in an integer array.
Calculate the non-circular maximum subarray sum using Kadane's algorithm.
Calculate the circular maximum subarray sum by subtracting the minimum subarray sum from the total sum.
Compare the non-circular and circular maximum subarray sums to get the overall maximum sum.
1)graph question 2)dp question
I applied via LinkedIn and was interviewed in Apr 2024. There was 1 interview round.
MakeMyTrip interview questions for designations
I applied via Referral and was interviewed in Apr 2024. There was 1 interview round.
Get interview-ready with Top MakeMyTrip Interview Questions
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
I applied via Campus Placement and was interviewed before May 2023. There were 2 interview rounds.
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
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.
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...
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.
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
I applied via Referral and was interviewed in Nov 2021. There was 1 interview round.
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
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next
points back to a previous node in the ...
Detect if a singly linked list forms a cycle by checking if a node's next pointer points back to a previous node.
Traverse the linked list using two pointers, one moving at double the speed of the other.
If the two pointers meet at any point, there is a cycle in the linked list.
Use Floyd's Cycle Detection Algorithm for O(N) time complexity and O(1) space complexity.
Round duration - 75 minutes
Round difficulty - Medium
It was an online coding test in which 3 coding question were given.
Given two strings, S
and X
, your task is to find the smallest substring in S
that contains all the characters present in X
.
S = "abdd", X = "bd"
Find the smallest substring in string S that contains all characters in string X.
Iterate through string S and keep track of characters in X found in a window
Use two pointers to maintain the window and slide it to find the smallest window
Return the smallest window containing all characters in X
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...
Find the smallest positive integer that cannot be expressed as the sum of elements from any proper subset of a non-decreasing sorted array of positive numbers.
Start with the smallest possible integer that cannot be represented, which is 1.
Iterate through the array and update the smallest integer that cannot be represented.
If the current element is greater than the smallest integer that cannot be represented, return tha...
Given a square chessboard of size 'N x N', determine the minimum number of moves a Knight requires to reach a specified target position from its initial position...
Calculate the minimum number of moves a Knight needs to reach a target position on a chessboard.
Implement a function that takes knight's starting position, target position, and chessboard size as input
Use breadth-first search algorithm to find the shortest path for the Knight
Consider all possible 8 movements of the Knight on the chessboard
Return the minimum number of moves required for the Knight to reach the target po
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
Given a singly linked list of integers, return the head of the reversed linked list.
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link...
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.
Keep track of the current, previous, and next nodes while reversing the linked list.
Update the head of the reversed linked list as the last node encountered during reversal.
FTP uses port number 21 and SMTP uses port number 25.
FTP uses port 21 for data transfer and port 20 for control information.
SMTP uses port 25 for email communication.
Understanding port numbers is important for network communication.
The OSI Model is a conceptual framework that standardizes the functions of a telecommunication or computing system into seven layers.
The OSI Model stands for Open Systems Interconnection Model.
It consists of seven layers: Physical, Data Link, Network, Transport, Session, Presentation, and Application.
Each layer has specific functions and communicates with the adjacent layers.
Example: Layer 1 (Physical) deals with physi...
To copy files in Linux, you can use the 'cp' command.
Use the 'cp' command followed by the source file and destination directory to copy a file.
To copy a directory and its contents, use the '-r' flag with the 'cp' command.
You can also use wildcards like '*' to copy multiple files at once.
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.
Top trending discussions
Some of the top questions asked at the MakeMyTrip Software Developer interview -
based on 6 interviews
1 Interview rounds
based on 13 reviews
Rating in categories
Senior Software Engineer
324
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
272
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Business Development Manager
226
salaries
| ₹0 L/yr - ₹0 L/yr |
Holiday Expert
225
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Executive
210
salaries
| ₹0 L/yr - ₹0 L/yr |
Cleartrip
Yatra
Goibibo
Oyo Rooms