AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
MakeMyTrip
Compare
Filter interviews by
MakeMyTrip Full Stack Developer Interview Questions and Answers
18 Interview questions
Minimum Operations Problem Statement
You are given an array 'ARR' of size 'N' consisting of positive integers. Your task is to determine the minimum number of operations required to make all elements in th...
Minimum number of operations to make all elements in an array equal by performing addition, subtraction, multiplication, or division.
Iterate through the array to find the maximum and minimum elements.
Calculate the difference between the maximum and minimum elements.
The minimum number of operations needed is the difference between the maximum and minimum elements.
Number of Islands II Problem Statement
You have a 2D grid of dimensions 'N' rows by 'M' columns, initially filled with water. You are given 'Q' queries, where each query contains two integers 'X' and 'Y'. ...
The task is to determine the number of islands present on a 2D grid after each query of converting water to land.
Create a function that takes the grid dimensions, number of queries, and query coordinates as input.
For each query, convert the water at the given coordinates to land and then count the number of islands on the grid.
Use depth-first search (DFS) or breadth-first search (BFS) to identify connected land ce...
Tower of Hanoi Problem Statement
You have three rods numbered from 1 to 3, and 'N' disks initially stacked on the first rod in increasing order of their sizes (largest disk at the bottom). Your task is to ...
Tower of Hanoi problem involves moving 'N' disks from one rod to another following specific rules in less than 2^N moves.
Implement a recursive function to move disks from one rod to another while following the rules.
Use the concept of recursion and backtracking to solve the Tower of Hanoi problem efficiently.
Maintain a count of moves and track the movement of disks in a 2-D array/list.
Ensure that larger disks are ...
Make Array Elements Equal Problem Statement
Given an integer array, your objective is to change all elements to the same value, minimizing the cost. The cost of changing an element from x to y is defined a...
Find the minimum cost to make all elements of an array equal by changing them to the same value.
Calculate the median of the array and find the sum of absolute differences between each element and the median.
Sort the array and find the median element, then calculate the sum of absolute differences between each element and the median.
If the array has an even number of elements, consider the average of the two middle...
Square Root with Decimal Precision Problem Statement
You are provided with two integers, 'N' and 'D'. Your objective is to determine the square root of the number 'N' with a precision up to 'D' decimal pla...
Implement a function to find the square root of a number with a given precision.
Create a function that takes 'N' and 'D' as input parameters
Use a mathematical algorithm like Newton's method to approximate the square root
Iterate until the precision condition is met
Return the square root with the required precision
Sub Sort Problem Statement
You are given an integer array ARR. Determine the length of the shortest contiguous subarray which, when sorted in ascending order, results in the entire array being sorted in as...
Determine the length of the shortest contiguous subarray that needs to be sorted to make the entire array sorted in ascending order.
Iterate from left to right to find the first element out of order.
Iterate from right to left to find the last element out of order.
Calculate the length of the subarray between the two out of order elements.
Multithreading allows multiple threads to run concurrently, while semaphores are used to control access to shared resources in a synchronized manner.
Multithreading involves running multiple threads within a single process, allowing for parallel execution of tasks.
Semaphores are used to control access to shared resources by allowing only a certain number of threads to access the resource at a time.
Semaphores can be...
Shortest Path in a Binary Matrix Problem Statement
Given a binary matrix of size N * M where each element is either 0 or 1, find the shortest path from a source cell to a destination cell, consisting only ...
Find the shortest path in a binary matrix from a source cell to a destination cell consisting only of 1s.
Use Breadth First Search (BFS) algorithm to find the shortest path.
Keep track of visited cells to avoid revisiting them.
Calculate the path length by counting the number of 1s in the path.
Handle edge cases such as invalid inputs and unreachable destination.
Validate Binary Search Tree (BST)
You are given a binary tree with 'N' integer nodes. Your task is to determine whether this binary tree is a Binary Search Tree (BST).
BST Definition:
A Binary Search Tre...
Validate if a given binary tree is a Binary Search Tree (BST) or not.
Check if the left subtree of a node contains only nodes with data less than the node's data.
Check if the right subtree of a node contains only nodes with data greater than the node's data.
Ensure that both the left and right subtrees are also binary search trees.
Traverse the tree in an inorder manner and check if the elements are in sorted order.
R...
Delete Node in Binary Search Tree Problem Statement
You are provided with a Binary Search Tree (BST) containing 'N' nodes with integer data. Your task is to remove a given node from this BST.
A BST is a b...
Implement a function to delete a node from a Binary Search Tree and return the inorder traversal of the modified BST.
Understand the properties of a Binary Search Tree (BST) - left subtree contains nodes with data less than the node, right subtree contains nodes with data greater than the node.
Implement a function to delete the given node from the BST while maintaining the BST properties.
Perform inorder traversal o...
MakeMyTrip Full Stack Developer Interview Experiences
3 interviews found
I appeared for an interview in Sep 2021.
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
The test was in the morning at around 11.
It was on online assessment.
HackerEarth was perfect like everytime.\
MCQ were based on HTML ,CSS , JS, OOPS, SQL, Aptitude, OS.
- Q1.
Reach the Destination Problem Statement
You are given a source point (sx, sy) and a destination point (dx, dy). Determine if it is possible to reach the destination point using only the following valid mo...
- Ans.
The problem involves determining if it is possible to reach a destination point from a source point using specified moves.
Iterate through each test case and check if destination is reachable from source using specified moves
Implement a recursive function to explore all possible paths from source to destination
Keep track of visited points to avoid infinite loops
Return true if destination is reachable, false otherwise
- Q2.
Delete Node in Binary Search Tree Problem Statement
You are provided with a Binary Search Tree (BST) containing 'N' nodes with integer data. Your task is to remove a given node from this BST.
A BST is a ...
- Ans.
Implement a function to delete a node from a Binary Search Tree and return the inorder traversal of the modified BST.
Understand the properties of a Binary Search Tree (BST) - left subtree contains nodes with data less than the node, right subtree contains nodes with data greater than the node.
Implement a function to delete the given node from the BST while maintaining the BST properties.
Perform inorder traversal of the...
(3 Questions)
Round duration - 90 Minutes
Round difficulty - Hard
The interviewer was very friendly. He gave me problems one by one and asked me to write code for all of them in Code Pair round. Explain Scope and Scope Chain in javascript. What is a Stored Procedure in SQL?
- Q1.
Shortest Path in a Binary Matrix Problem Statement
Given a binary matrix of size
N * Mwhere each element is either 0 or 1, find the shortest path from a source cell to a destination cell, consisting only... - Ans.
Find the shortest path in a binary matrix from a source cell to a destination cell consisting only of 1s.
Use Breadth First Search (BFS) algorithm to find the shortest path.
Keep track of visited cells to avoid revisiting them.
Calculate the path length by counting the number of 1s in the path.
Handle edge cases such as invalid inputs and unreachable destination.
- Q2.
Pair Sum Problem Statement
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Note:
... - Ans.
Given an array of integers and a target sum, find all pairs of elements that add up to the target sum.
Use a hashmap to store the difference between the target sum and each element as keys and their indices as values.
Iterate through the array and check if the current element's complement exists in the hashmap.
Return the pairs of elements that add up to the target sum in sorted order.
- Q3.
Validate Binary Search Tree (BST)
You are given a binary tree with 'N' integer nodes. Your task is to determine whether this binary tree is a Binary Search Tree (BST).
BST Definition:
A Binary Search Tr...
- Ans.
Validate if a given binary tree is a Binary Search Tree (BST) or not.
Check if the left subtree of a node contains only nodes with data less than the node's data.
Check if the right subtree of a node contains only nodes with data greater than the node's data.
Ensure that both the left and right subtrees are also binary search trees.
Traverse the tree in an inorder manner and check if the elements are in sorted order.
Recurs...
(2 Questions)
Round duration - 45 minutes
Round difficulty - Medium
The round was with CTO level person. He was very friendly. What is the difference between SQL and MySQL? What are Constraints in SQL?
- Q1.
Longest Duplicate Substring Problem Statement
You are provided with a string 'S'. The task is to determine the length of the longest duplicate substring within this string. Note that duplicate substrings ...
- Ans.
Find the length of the longest duplicate substring in a given string.
Iterate through all possible substrings of the input string.
Use a rolling hash function to efficiently compare substrings.
Store the lengths of duplicate substrings and return the maximum length.
- Q2.
Maximum Sum of Products for Array Rotations
You are given an array
ARRconsisting ofNelements. Your task is to determine the maximum value of the summation ofi * ARR[i]among all possible rotations of... - Ans.
Find the maximum sum of products for array rotations.
Iterate through all possible rotations of the array and calculate the sum of products for each rotation.
Keep track of the maximum sum of products found so far.
Return the maximum sum of products obtained.
Interview Preparation Tips
Tip 1 : DSA should be very very good.
Tip 2 : Computer Science Fundamentals are very important
Tip 3 : Think out loud in an interview
Tip 1 : At least 2 very well prepared projects
Tip 2 : Internship experiences always help
Skills evaluated in this interview
I appeared for an interview in Sep 2021.
(2 Questions)
Round duration - 90 minutes
Round difficulty - Easy
2 Coding Questions and 20 MCQ's to be solved in 90 minutes. It was from 6 pm. The camera and screen-recorders were on. The mcq was on web, oops, dbms.
- Q1.
Number of Islands II Problem Statement
You have a 2D grid of dimensions 'N' rows by 'M' columns, initially filled with water. You are given 'Q' queries, where each query contains two integers 'X' and 'Y'....
- Ans.
The task is to determine the number of islands present on a 2D grid after each query of converting water to land.
Create a function that takes the grid dimensions, number of queries, and query coordinates as input.
For each query, convert the water at the given coordinates to land and then count the number of islands on the grid.
Use depth-first search (DFS) or breadth-first search (BFS) to identify connected land cells f...
- Q2.
Make Array Elements Equal Problem Statement
Given an integer array, your objective is to change all elements to the same value, minimizing the cost. The cost of changing an element from
xtoyis defined ... - Ans.
Find the minimum cost to make all elements of an array equal by changing them to the same value.
Calculate the median of the array and find the sum of absolute differences between each element and the median.
Sort the array and find the median element, then calculate the sum of absolute differences between each element and the median.
If the array has an even number of elements, consider the average of the two middle elem...
(4 Questions)
Round duration - 70 minutes
Round difficulty - Medium
The interview started with the interviewer asking me about my projects and why and what I have used in them. Be very clear with all the technologies you have used in your project as the interviewer will ask you in-depth about it.
Explain Components, Modules and Services in Angular. What is a Recursive Stored Procedure?
- Q1.
Sub Sort Problem Statement
You are given an integer array
ARR. Determine the length of the shortest contiguous subarray which, when sorted in ascending order, results in the entire array being sorted in a... - Ans.
Determine the length of the shortest contiguous subarray that needs to be sorted to make the entire array sorted in ascending order.
Iterate from left to right to find the first element out of order.
Iterate from right to left to find the last element out of order.
Calculate the length of the subarray between the two out of order elements.
- Q2.
Minimum Operations Problem Statement
You are given an array
'ARR'of size'N'consisting of positive integers. Your task is to determine the minimum number of operations required to make all elements in t... - Ans.
Minimum number of operations to make all elements in an array equal by performing addition, subtraction, multiplication, or division.
Iterate through the array to find the maximum and minimum elements.
Calculate the difference between the maximum and minimum elements.
The minimum number of operations needed is the difference between the maximum and minimum elements.
- Q3.
Tower of Hanoi Problem Statement
You have three rods numbered from 1 to 3, and 'N' disks initially stacked on the first rod in increasing order of their sizes (largest disk at the bottom). Your task is to...
- Ans.
Tower of Hanoi problem involves moving 'N' disks from one rod to another following specific rules in less than 2^N moves.
Implement a recursive function to move disks from one rod to another while following the rules.
Use the concept of recursion and backtracking to solve the Tower of Hanoi problem efficiently.
Maintain a count of moves and track the movement of disks in a 2-D array/list.
Ensure that larger disks are not p...
- Q4. Can you explain the concepts of multithreading and semaphore in operating systems?
- Ans.
Multithreading allows multiple threads to run concurrently, while semaphores are used to control access to shared resources in a synchronized manner.
Multithreading involves running multiple threads within a single process, allowing for parallel execution of tasks.
Semaphores are used to control access to shared resources by allowing only a certain number of threads to access the resource at a time.
Semaphores can be bina...
(1 Question)
Round duration - 30 minutes
Round difficulty - Easy
The interviewer was VP of Engineering at MakeMyTrip with more than 10 years of experience. He asked about the 4 Pillars of OOPS and we had an in-depth discussion with real-life applications for each of them.
- Q1.
Square Root with Decimal Precision Problem Statement
You are provided with two integers, 'N' and 'D'. Your objective is to determine the square root of the number 'N' with a precision up to 'D' decimal pl...
- Ans.
Implement a function to find the square root of a number with a given precision.
Create a function that takes 'N' and 'D' as input parameters
Use a mathematical algorithm like Newton's method to approximate the square root
Iterate until the precision condition is met
Return the square root with the required precision
Interview Preparation Tips
Tip 1 : Never lose hope. Just keep working.
Tip 2 : Solve at least 5 problems each day of medium level or 3 questions of hard level with complete understanding.
Tip 3 : Keep at least 3-4 projects in your resume.
Tip 1 : Keep it 1 page.
Tip 2 : Revise it very well before the interview.
Tip 3 : Know your projects in-depth. They might also ask you to show a demo as it is a virtual interview. So, keep them ready before the interview.
Skills evaluated in this interview
I appeared for an interview in Aug 2021.
(2 Questions)
Round duration - 120 Minutes
Round difficulty - Medium
There were two sections mcq's and coding. We were allowed to switch between sections and there was no specific time for any section. Around 350 students gave the test.
- Q1.
Count Inversions Problem Statement
Given an integer array
ARRof sizeN, your task is to find the total number of inversions that exist in the array.An inversion is defined for a pair of integers in the...
- Ans.
Count the total number of inversions in an integer array.
Iterate through the array and for each pair of elements, check if the inversion condition is met.
Use a nested loop to compare each pair of elements efficiently.
Keep a count of the inversions found and return the total count at the end.
- Q2.
Maximum Consecutive Ones Problem Statement
Given a binary array 'ARR' of size 'N', your task is to determine the maximum length of a sequence consisting solely of 1’s that can be obtained by converting at...
- Ans.
Find the maximum length of a sequence of 1's by converting at most K zeroes into ones in a binary array.
Iterate through the array and keep track of the current window of 1's and zeroes.
Use a sliding window approach to find the maximum length of the sequence.
Update the window by flipping zeroes to ones within the limit of K flips.
Return the maximum length of the sequence obtained.
(2 Questions)
Round duration - 50 Minutes
Round difficulty - Medium
About 45 students were shortlisted for this round. My interview was at 10:15am. I was asked to introduce myself.
- Q1.
Maximum Distance Problem Statement
Given an integer array 'A' of size N, your task is to find the maximum value of j - i, with the restriction that A[i] <= A[j], where 'i' and 'j' are indices of the ar...
- Ans.
Find the maximum distance between two elements in an array where the element at the first index is less than or equal to the element at the second index.
Iterate through the array and keep track of the minimum element encountered so far along with its index.
Calculate the maximum distance by subtracting the current index from the index of the minimum element.
Update the maximum distance if a greater distance is found whil...
- Q2.
Determine the Left View of a Binary Tree
You are given a binary tree of integers. Your task is to determine the left view of the binary tree. The left view consists of nodes that are visible when the tree...
- Ans.
The task is to determine the left view of a binary tree, which consists of nodes visible when viewed from the left side.
Traverse the binary tree level by level from left to right, keeping track of the first node encountered at each level.
Use a queue to perform level order traversal and keep track of the level number for each node.
Store the first node encountered at each level in a result array to get the left view of t...
Round duration - 40 Minutes
Round difficulty - Easy
About 17 students cleared the first round. My second round was at 4:30pm. The interviewer was very humble.
Round duration - 20 Minutes
Round difficulty - Easy
This was HR round, 7 students were shortlisted for this round. I received the call after 6:30pm.
Interview Preparation Tips
Tip 1 : For on campus placements, focus more on core subjects rather than very good projects/internships.
Tip 2 : You must cover all important Data Structures and their important/fundamental questions at least twice. For advanced Data Structures like DP, graph, trees, you should have good practice before hand.
Tip 3 : Solve aptitude questions occasionally.
Tip 1 : Don't put too much skills/projects if you are not confident about it, u need not have very rich resume during on campus placements
Tip 2 : it should be readable and authentic
Skills evaluated in this interview
Top trending discussions
Interview questions from similar companies
I appeared for an interview before Jan 2021.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Two coding questions were given in the first round to be solved in 60 minutes.
- Q1.
Rearrange Array Elements Problem Statement
Given an array
Acontaining 'N' integers and an integerm, rearrange the elements of the array such that the differences between the array elements andmare sor... - Ans.
Rearrange array elements based on their differences from a given integer.
Calculate the differences between each element and the given integer.
Sort the elements based on their differences while maintaining the original order for elements with the same difference.
Implement a function to rearrange the array elements as per the given criteria.
- Q2.
Print Nodes at Distance K from a Given Node
Given an arbitrary binary tree, a node of the tree, and an integer 'K', find all nodes that are at a distance K from the specified node, and return a list of th...
- Ans.
The task is to find all nodes in a binary tree that are at a distance K from a given node.
Traverse the binary tree to find the given node
From the given node, perform a depth-first search to find all nodes at distance K
Use a list to store the values of the nodes at distance K
Return the list of values in any order
(4 Questions)
Round duration - 60 minutes
Round difficulty - Easy
This was a technical round with questions based on DSA, DBMS, Computer Networking and project based questions.
- Q1.
Triangle of Numbers Pattern
Ninja is tasked with printing a triangle pattern based on a given number 'N' for any test case.
Example:
Input:
N = 4
Output:
1
232
34545
4567654Explanation:
The pat...
- Ans.
Print a triangle pattern of numbers based on a given number 'N'.
Iterate through each row and print the numbers accordingly
Use spaces to center-align the numbers in each row
Increment the numbers in each row as per the pattern
- Q2. What is the difference between a web server and an application server?
- Ans.
Web server serves static content over HTTP, while application server runs dynamic content and business logic.
Web server handles HTTP requests and responses, serving static content like HTML, images, and CSS.
Application server executes business logic, runs dynamic content, and interacts with databases.
Web server examples include Apache, Nginx, while application server examples include Tomcat, JBoss.
Web server focuses on...
- Q3. How does the internet work?
- Ans.
The internet is a global network of interconnected computers that communicate using standardized protocols.
The internet is made up of a vast number of interconnected networks of computers.
Data is transmitted over the internet using protocols such as TCP/IP.
Websites are hosted on servers connected to the internet, and users access them using web browsers.
Internet Service Providers (ISPs) provide access to the internet f...
- Q4. Write a SQL query to find the nth highest salary.
- Ans.
SQL query to find the nth highest salary
Use the 'SELECT DISTINCT' statement to get unique salary values
Order the salaries in descending order using 'ORDER BY' clause
Use 'LIMIT' and 'OFFSET' to get the nth highest salary
Round duration - 30 minutes
Round difficulty - Easy
Typical HR round with behavioral problems.
Interview Preparation Tips
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.
Skills evaluated in this interview
Software Developer Interview Questions & Answers
Eternal Limited
Gulshan Kumar
posted on 30 Nov 2015
I applied via Campus Placement
Interview Preparation Tips
Experience: They selected 10 students from our college from CS and IT .They are looking for guys with extra projects done during college .App development will be a bonus ,contribution to open source and competitive programming will help for shortlisting.
Some of my friends had research papers published and they too got selected.
Round: Test
Experience: Have to write code snippet for 4 questions in 45 minutes
1.Difference between hour hand and minute hand
2.longest palindromic sub string.
3.Product Array puzzle
4.Some question related to matrix
Tips: All question were from geeksforgeeks
So practice it well ..u will make through it
Round: Test
Experience: Long Discussion on projects
They will scan each and every line of your Resume ,so dont write bullshits..
I wrote about interest in AI and got screwed..Discussion on college projects and final year project.
Then asked me to design a snake and ladder game OOPS concepts
Told me to find sum of all elements of sub matrix..(hint pre-processing the matrix)
Asked me about sessions and cookies
Gave a query to write on database indexing (dont remember exactly)
Asked me the code of the difference between hour hand and minute hand and extended it wid the second hand
Asked me as how to implement a dictionary
asked about TRIES ,CODE SNIPPET ON THE SHARED DOCS
One of my friend was asked to implement (set) of STL
Tips: The interviewer was cool guy..helped me a lot always made me comfortable.Interact with them as much as possible
Round: Test
Experience: Wid the CTO of the company .
Started wid the projects again .ACID properties,Database transactions,Concurrency Control
Optimization in database.
Then he asked me to code a function
Given a hash function applied on letters of English words ,un-hash it.Took me 45 minutes to reach the solution ,he helped me a lot.
Asked me to write the code for diameter of a binary tree
Asked me write the code for Boolean Matrix
One of my friend was asked to a question in which there was a bug in a m*n matrix and we have to find the bug(hint dfs or bfs)
Tips: keep calm ,,just keep talking ad he will help u a lot...
Round: HR
Experience: This was the toughest round for me...I had cleared all the rounds but they rejected me in the HR round ,,,dont know where I screwed..Learn every thing of Zomato..
They offered me an internship and thereafter they would look to give a PPO ...!!!lets see what happens
Skills: Coding Skills And Knowledge On Data Structures
Duration: 3
College Name: NIT Srinagar
I applied via Referral
Interview Questionnaire
6 Questions
- Q1. Design the most optimal data structures for an LRU cache
- Q2. Convert a sorted array to balanced binary search tree
- Ans.
Convert a sorted array to balanced binary search tree
Find the middle element of the array and make it the root of the tree
Recursively construct the left subtree using the left half of the array
Recursively construct the right subtree using the right half of the array
Repeat until all elements are added to the tree
- Q3. Reverse a singly linked list in groups of k inplace
- Ans.
Reverse a singly linked list in groups of k inplace
Divide the linked list into groups of k nodes
Reverse each group of k nodes
Connect the reversed groups to form the final linked list
- Q4. Design the most optimal data structure for storing a word and its meaning. Note that a word could have multiple meanings
- Q5. Write a recursive routine to calculate a ^ n
- Ans.
A recursive routine to calculate a ^ n
The base case is when n is 0, in which case the result is 1
For any other value of n, the result is a multiplied by the result of a^(n-1)
The recursive function should call itself with a^(n-1) as the new input
- Q6. Design the most optimal data structure for a never ending stream of numbers. It should be optimized for insertion, deletion, searching, finding kth largest and kth smallest
- Ans.
Design optimal data structure for never-ending stream of numbers for insertion, deletion, searching, kth largest and kth smallest.
Use a balanced binary search tree like AVL or Red-Black tree for efficient insertion, deletion, and searching.
Maintain two heaps, one for kth largest and one for kth smallest.
For finding kth largest, use a min heap of size k and for kth smallest, use a max heap of size k.
Alternatively, use a...
Interview Preparation Tips
College Name: NA
Skills evaluated in this interview
Interview Preparation Tips
Duration: 2 hours
Total Questions: 22
College Name: Jaypee University Of Information Technology, Solan
Sumit Singh
I appeared for an interview before Sep 2016.
Interview Questionnaire
5 Questions
- Q1. Search an element in sorted rotated array.
- Ans.
Search an element in sorted rotated array.
Use binary search to find the pivot point where the array is rotated.
Divide the array into two subarrays and perform binary search on the appropriate subarray.
Handle the cases where the target element is at the pivot point or not present in the array.
- Q2. Kth largest element in an array.
- Ans.
Find the Kth largest element in an array.
Sort the array in descending order and return the element at index K-1.
Use a max heap to find the Kth largest element efficiently.
Implement a quickselect algorithm to find the Kth largest element in linear time.
- Q3. Reverse a linked list in group of n element.
- Ans.
Reverse a linked list in groups of n elements.
Divide the linked list into groups of n elements.
Reverse each group individually.
Connect the reversed groups to form the final linked list.
Handle cases where the number of elements is not a multiple of n.
Example: 1->2->3->4->5->6->7->8, n=3 -> 3->2->1->6->5->4->8->7
- Q4. Median of two sorted array.
- Ans.
Find the median of two sorted arrays.
Merge the two arrays into one sorted array and find the median.
Use binary search to find the median in O(log(min(m, n))) time complexity.
Handle edge cases like empty arrays or arrays of different lengths.
- Q5. It was a DP question. In a matrix, I have to count number of paths from (0, 0) to (m, n) while crossing through some indexes were not allowed.
- Ans.
Count number of paths from (0, 0) to (m, n) in a matrix while crossing through some indexes were not allowed.
Use dynamic programming to solve the problem
Create a 2D array to store the number of paths
Traverse the matrix and update the array based on the allowed paths
Return the value at the last index of the array
Interview Preparation Tips
Experience: Interviewer was mainly focused on problem solving skill.
College Name: KIIT University
Skills evaluated in this interview
I appeared for an interview in Aug 2017.
Interview Preparation Tips
Experience: Platform: Hackerearth
20 MCQs with negative marking, topics included OS, DS-Algo, Networking.
2 Programming Problems.
Duration: 1 hour 30 minutes
Total Questions: 22
Round: Technical Interview
Experience: 3 DS-Algo problems were asked. Made to written codes on paper.
Round: Technical Interview
Experience: 2 DS-Algo problems were asked. Made to written codes on paper.
Few OS questions were also asked.
Skills: Data Structures and Algorithms, Operating Systems
College Name: IIT (BHU)
I applied via Campus Placement
Interview Questionnaire
4 Questions
- Q1. Given a binary tree, build a doubly linked list for the leaves of the tree in the given order without using any extra space
- Ans.
The question asks to convert the leaves of a binary tree into a doubly linked list without using extra space.
Traverse the binary tree in a depth-first manner
When a leaf node is encountered, update its left and right pointers to form the doubly linked list
Keep track of the previous leaf node to update its right pointer
Return the head of the doubly linked list
- Q2. Given a table m*n , find the number of ways of reaching from one corner to opposite corner, if a person can only move in two directions( towards the goal)
- Ans.
Count number of ways to reach opposite corner of a m*n table moving in two directions only.
Use dynamic programming to solve the problem
The number of ways to reach a cell is the sum of the number of ways to reach the cell above it and the cell to the left of it
The number of ways to reach the opposite corner is the number of ways to reach the cell in the last row and last column
Example: For a 2*2 table, there are 2 ways ...
- Q3. A person can take one or two steps at a time. Find the number of ways in which n steps can be travelled
- Ans.
The number of ways to travel n steps by taking one or two steps at a time.
This is a classic problem that can be solved using dynamic programming.
The number of ways to travel n steps is equal to the sum of the number of ways to travel n-1 steps and n-2 steps.
Use an array to store the number of ways for each step, starting with base cases for 0 and 1 steps.
Iterate through the array to calculate the number of ways for eac...
- Q4. Take a infix expression as input and print its postfix expression
- Ans.
Convert infix expression to postfix expression.
Use a stack to keep track of operators.
Iterate through the infix expression and push operands to output.
If an operator is encountered, pop operators from stack until a lower precedence operator is found.
Push the operator to stack.
After iterating, pop remaining operators from stack and append to output.
Reverse the output to get postfix expression.
Interview Preparation Tips
Experience: Multiple choice questions pretty much covered everything. This included details of big O notation , concepts from computer organisation etc . Be a little careful while writing outputs as there might be misleading options.
Duration: 90 minutes
Total Questions: 22
Round: Technical Interview
Experience: Building part was quite easy . Should have a little practice of writing code on paper.
Be careful about edge cases . The interviewer took it pretty seriously (things like root node should not be null)
Skills: Data Structures And Algorithms, C and one Object oriented language, Computer Organisation, Basic Aptitude topics like Combinatorics
Duration: 2 months
College Name: IIT Madras
Skills evaluated in this interview
Tell us how to improve this page.
MakeMyTrip Interviews By Designations
- MakeMyTrip Software Developer Interview Questions
- MakeMyTrip Senior Software Engineer Interview Questions
- MakeMyTrip Software Engineer Interview Questions
- MakeMyTrip Product Manager Interview Questions
- MakeMyTrip Holiday Expert Interview Questions
- MakeMyTrip Senior QA Engineer Interview Questions
- MakeMyTrip Senior Business Development Manager Interview Questions
- MakeMyTrip Senior Software Developer Interview Questions
- Show more
Interview Questions for Popular Designations
- Software Developer Interview Questions
- Java Developer Interview Questions
- Front end Developer Interview Questions
- Web Developer Interview Questions
- Senior Software Developer Interview Questions
- Application Developer Interview Questions
- Salesforce Developer Interview Questions
- Junior Software Developer Interview Questions
- Show more
Interview Questions from Similar Companies
|
Senior Software Engineer
339
salaries
|  ₹19 L/yr - ₹33 L/yr |
|
Assistant Manager
273
salaries
| ₹9 L/yr - ₹16.1 L/yr |
|
Software Engineer
242
salaries
| ₹13 L/yr - ₹23 L/yr |
|
Holiday Expert
229
salaries
| ₹2 L/yr - ₹6.2 L/yr |
|
Senior Business Development Manager
224
salaries
| ₹5.4 L/yr - ₹12 L/yr |
Cleartrip
Amazon
Flipkart
Indiamart Intermesh
- Home >
- Interviews >
- MakeMyTrip Interview Questions
