MakeMyTrip Interview Questions, Process, and Tips

Q1. Basic js question closure, async defer and all
Add your answer
Q2. Create autosuggest debounce, pollyfill
Ans. 
Autosuggest debounce is a feature that delays the search suggestions until the user stops typing, and a polyfill is a piece of code that provides functionality that is not natively supported by the browser.
• Implement a debounce function to delay the autosuggest feature until the user stops typing.

• Use a polyfill to provide support for the autosuggest feature in browsers that do not natively support it.

• Example: Implement ...read more
Answered by AI
Add your answer

Q1. A programming question
Add your answer
Q2. React-native architecture and flatlist
Add your answer
Q3. Kadanes algorithm
Ans. 
Kadane's algorithm is used to find the maximum subarray sum in an array of integers.
• Iterate through the array and keep track of the maximum sum ending at each index.

• At each index, choose between extending the previous subarray or starting a new subarray.

• Example: For array [-2, 1, -3, 4, -1, 2, 1, -5, 4], the maximum subarray sum is 6 (from index 3 to 6).
Answered by AI
Add your answer
Q4. Scalablity, performance
Add your answer

Q1. Internal Working Of Hashmap, Java 8 features and two DSA questions one was based on the array and the second one was based on LinkedList. The first interview round was very excellent that's why they conduc...read more
Add your answer
Q2. Detect loop in a LinkedList,
Ans. 
Detect loop in a LinkedList
• Use two pointers, one moving at twice the speed of the other

• If there is a loop, the faster pointer will eventually catch up to the slower one

• If there is no loop, the faster pointer will reach the end of the list
Answered by AI
Add your answer

Q1. System Design HLD and LLD round which was the final round.
Add your answer
Q2. HLD and LLD Designing round: Desing Architecture for ChatBot and Company Employee Data Management System.
Add your answer

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

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.
Add your answer

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...read more
Add your answer

Q1. Smallest window in a string containing all the characters of another string.(GFG)
Ans. 
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
Answered by AI
View 1 more answer
Q2. Check whether linked list is Pallindrome or not
Ans. 
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.
Answered by AI
Add your answer
Q3. Deadlocks,4 conditions of Deadlocks and ways of preventing Deadlock
Ans. 
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...read more
Answered by AI
Add your answer

Q1. Algorithm to find if any 5 numbers add up to the value of the Sum
Ans. 
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.
Answered by AI
Add your answer
Q2. What is DNS(Domain Name System)
Ans. 
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
Answered by AI
Add your answer

Q1. Introduction About yourself
Add your answer
Q2. Tell about previous Job
Add your answer

Q1. About your personal details, about your perivious profession, reson of resign, ok with sales and work from home.
Add your answer

Q1. Same as mentioned above
Add your answer