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 at Vellore Institute of Technology (VIT) 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 at Delhi College of Engineering (DCE), Delhi 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 - 90 minutes
Round difficulty - Medium
Questions on aptitude, English, logical reasoning, C/C++ and 5 coding ques. (only pseudo code).
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...
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"
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...
Round duration - 60 minutes
Round difficulty - Easy
Questions based on OOPS were asked in this round.
Round duration - 30 minutes
Round difficulty - Easy
HR round with typical behavioral problems.
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
| ₹13.5 L/yr - ₹33 L/yr |
Assistant Manager
294
salaries
| ₹4.5 L/yr - ₹18.7 L/yr |
Holiday Expert
225
salaries
| ₹1 L/yr - ₹7 L/yr |
Senior Business Development Manager
217
salaries
| ₹4.5 L/yr - ₹12 L/yr |
Senior Executive
210
salaries
| ₹1.6 L/yr - ₹9 L/yr |
Cleartrip
Yatra
Goibibo
Oyo Rooms