i
MakeMyTrip
Filter interviews by
Find the subset of an array with the largest sum of continuous positive numbers.
Iterate through the array and keep track of the current sum and the maximum sum seen so far.
If the current element is positive, add it to the current sum. If it is negative, reset the current sum to 0.
Also keep track of the start and end indices of the maximum sum subset.
Return the subset using the start and end indices.
Find smallest substring in s1 containing all characters of s2.
Create a hash table of characters in s2
Use sliding window technique to find smallest substring in s1
Check if all characters in s2 are present in the substring
Update the smallest substring if a smaller one is found
Algorithm to reverse a linked list
Create a new empty linked list
Traverse the original linked list and insert each node at the beginning of the new list
Return the new list
Lazy loading is a technique used to defer the loading of non-critical resources until they are needed.
Advantages: faster initial page load, reduced bandwidth usage, improved user experience
Disadvantages: increased complexity, potential for slower subsequent page loads, difficulty with SEO
Examples: images, videos, and other media files can be loaded only when they are visible on the screen
Ajax is a technique for creating fast and dynamic web pages. AngularJS is a framework for building dynamic web applications, while jQuery is a library for simplifying HTML DOM traversal and manipulation.
Ajax stands for Asynchronous JavaScript and XML
It allows web pages to be updated asynchronously by exchanging data with a web server behind the scenes
AngularJS is a JavaScript framework that extends HTML with new attrib...
A traffic light system controls the flow of traffic at intersections.
The system consists of three lights: red, yellow, and green.
Each light has a specific duration for which it stays on.
The system also includes sensors to detect the presence of vehicles and pedestrians.
The duration of each light can be adjusted based on traffic patterns.
The system can be connected to a central control system for remote monitoring and m
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
MakeMyTrip interview questions for designations
I applied via LinkedIn and was interviewed in Apr 2024. There was 1 interview round.
Get interview-ready with Top MakeMyTrip Interview Questions
I applied via Referral and was interviewed in Apr 2024. There was 1 interview round.
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).
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.
Top trending discussions
1 Interview rounds
based on 13 reviews
Rating in categories
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