MakeMyTrip Interview Questions, Process, and Tips for Experienced

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

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).

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...read more

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