MakeMyTrip Interview Questions and Answers

Q1. Explain current projects ?
Add your answer
Q2. Train water trapping problem
Ans. 
Train water trapping problem involves calculating the amount of water that can be trapped between blocks.
• Calculate the maximum height of blocks on left and right of each block

• Find the minimum of the two heights and subtract the height of the current block to get trapped water

• Sum up the trapped water for all blocks to get total trapped water
Answered by AI
Add your answer

Q1. Reverse stack which using another stack (Recursion)
Ans. 
Reverse a stack using another stack and recursion to achieve the desired order of elements.
• Use a temporary stack to hold elements while reversing.

• Pop elements from the original stack and push them onto the temporary stack.

• Once the original stack is empty, pop from the temporary stack to restore the order.

• Recursion can be used to pop all elements and then push them back in reverse order.
Answered by AI
Add your answer
Q2. Find element in sorted rotated array
Ans. 
Search for an element in a sorted rotated array
• Use binary search to find the pivot point where the array is rotated

• Then perform binary search on the appropriate half of the array to find the element

• Handle cases where the element is not found in the array
Answered by AI
Add your answer

Q1. LLD for twitter
Ans. 
Design a low-level architecture for a Twitter-like social media platform.
• User Management: Handle user registration, authentication, and profiles.

• Tweet Management: Allow users to create, read, update, and delete tweets.

• Feed Generation: Implement algorithms to generate a personalized feed for users.

• Follow System: Enable users to follow/unfollow others and manage relationships.

• Notifications: Provide real-time notification...read more
Answered by AI
Add your answer

Q1. HLD for poker game
Ans. 
Design a high-level architecture for a multiplayer poker game application.
• User Authentication: Players can create accounts and log in securely.

• Game Lobby: A centralized area where players can join or create poker tables.

• Game Logic: Implement rules for poker variants (e.g., Texas Hold'em, Omaha).

• Real-time Communication: Use WebSockets for real-time updates between players.

• Database: Store user profiles, game history, and...read more
Answered by AI
Add your answer

Q1. Standard LeetCode Hard Question. But interviewer did not give the required image to understand what exactly was required. He himself was confused.
Add your answer

Q1. Api status codes, api debugging questions
Add your answer
Q2. If you get 500 error how to debug.
Ans. 
To debug a 500 error, check server logs, review code changes, test API endpoints, and use debugging tools.
• Check server logs for error details

• Review recent code changes that may have caused the error

• Test API endpoints using tools like Postman

• Use debugging tools like Chrome DevTools or Firebug
Answered by AI
Add your answer
Q3. One java string question merge two strings diagonally.
Ans. 
Merge two strings diagonally in a Java array of strings.
• Iterate through each row and column to merge characters diagonally

• Keep track of the diagonal position to insert characters from both strings

• Handle cases where strings have different lengths

• Example: String 1: 'hello', String 2: 'world', Merged: 'hweolrllod'

• Example: String 1: 'abc', String 2: '123', Merged: 'a1b2c3'
Answered by AI
Add your answer

1 hr of test on code earth platform

Q1. LPS array in string
Ans. 
LPS array in string refers to the Longest Palindromic Substring array in a given string.
• Create an array to store all the palindromic substrings found in the given string.

• Iterate through the string and check for palindromic substrings of different lengths.

• Store the longest palindromic substrings in the array.
Answered by AI
Add your answer
Q2. DP on grid problem
Ans. 
Dynamic Programming on grid problems involves optimizing paths or values in a 2D matrix using overlapping subproblems.
• Define the grid dimensions (m x n) and initialize a DP table.

• Base case: Set DP[0][0] = grid[0][0] for starting point.

• Fill the first row and first column by accumulating values.

• Use the relation DP[i][j] = grid[i][j] + min(DP[i-1][j], DP[i][j-1]) for other cells.

• Example: For a grid with values, calculate ...read more
Answered by AI
Add your answer

What do you charge for VISA insurance?