i
MakeMyTrip
Filter interviews by
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
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'
I applied via Recruitment Consulltant and was interviewed before Oct 2022. There were 6 interview rounds.
2 programming question moderate level
I appeared for an interview before Feb 2021.
Round duration - 60 minutes
Round difficulty - Easy
This was a written test with 2 coding problems.
Given an array of distinct positive integers ARR
and a non-negative integer 'B', find all unique combinations in the array where the sum is equal to 'B'. Numbers can be c...
The task is to find all unique combinations in an array where the sum is equal to a given target sum, with elements in non-decreasing order.
Use backtracking to generate all possible combinations.
Sort the array to ensure elements are in non-decreasing order.
Keep track of the current combination and sum while exploring the array.
Recursively explore all possible combinations.
Return the valid combinations that sum up to th...
Given a string S
which represents a number, determine the smallest number strictly greater than the original number composed of the same digits. Each digit's frequenc...
The task is to find the smallest number greater than the given number with the same set of digits.
Iterate from right to left to find the first digit that can be swapped with a larger digit to make the number greater.
Swap this digit with the smallest digit to its right that is larger than it.
Sort all digits to the right of the swapped digit in ascending order to get the smallest number.
If no such number exists, return -...
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.
I applied via Naukri.com and was interviewed in Dec 2019. There were 3 interview rounds.
Program to find all possible combinations of elements from two sets of arrays such that the sum of elements is equal to one of the elements in the array itself.
Create two arrays of integers
Loop through both arrays and find all possible combinations
Check if the sum of elements is equal to any element in the array
Return all combinations that meet the criteria
Program to find the next bigger number for the given number by interchanging its digits.
Convert the number to a string to access individual digits
Start from the rightmost digit and find the first digit that is smaller than the digit to its right
Swap this digit with the smallest digit to its right that is greater than it
Sort the digits to the right of the swapped digit in ascending order
Convert the string back to a numb...
Top trending discussions
Interview was very good, asked coding questions and testing principles
General aps questions were asked
I appeared for an interview in Oct 2016.
I applied via Campus Placement
Boundary traversal of a tree is the process of visiting the nodes on the boundary of a tree in a specific order.
The boundary traversal can be done in three steps: left boundary, leaf nodes, and right boundary.
For the left boundary, start from the root and traverse down the left side of the tree until reaching a leaf node.
For the leaf nodes, perform an inorder traversal to visit all the leaf nodes of the tree.
For the ri...
Find the nearest greater value of a given value in a Binary Search Tree (BST).
Start from the root node and compare the given value with the current node's value.
If the given value is less than the current node's value, move to the left subtree.
If the given value is greater than the current node's value, move to the right subtree.
Keep track of the closest greater value encountered while traversing the tree.
Return the cl...
Given an infinite staircase with a broken kth step, find the maximum height we can reach in n rounds of jumping i steps.
We can start by jumping the maximum number of steps in each round until we reach the broken step.
After reaching the broken step, we can discard the i steps that would land us on the broken step and jump the remaining steps.
We can continue this pattern until we reach the maximum height we can reach wit...
Construct a binary tree of height h and merge bottom nodes to create a cone-like structure.
A binary tree of height h has 2^h - 1 nodes.
Start combining leaf nodes from the bottom level upwards.
Each combination can be visualized as merging two nodes into one.
For example, if h=3, the tree has 7 nodes, and you combine nodes at levels 2 and 1.
The final structure resembles a cone as nodes are merged.
Some of the top questions asked at the MakeMyTrip Senior QA Engineer interview -
based on 2 interview experiences
Difficulty level
Duration
based on 2 reviews
Rating in categories
Senior Software Engineer
335
salaries
| ₹19 L/yr - ₹33 L/yr |
Assistant Manager
286
salaries
| ₹9 L/yr - ₹16.8 L/yr |
Software Engineer
255
salaries
| ₹12.6 L/yr - ₹23 L/yr |
Holiday Expert
235
salaries
| ₹2 L/yr - ₹6.1 L/yr |
Senior Business Development Manager
221
salaries
| ₹5.4 L/yr - ₹11.7 L/yr |
Cleartrip
Amazon
Flipkart
Indiamart Intermesh