AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
MakeMyTrip
Compare
Filter interviews by
Clear (1)
MakeMyTrip Senior Software Developer Interview Questions and Answers
MakeMyTrip Senior Software Developer Interview Experiences
2 interviews found
Mohnish Chandra
I applied via Recruitment Consulltant and was interviewed in Jan 2024. There was 1 interview round.
(1 Question)
- Q1. Rotten orange problem
- Ans.
The rotten orange problem involves determining the minimum number of minutes it takes for all oranges to become rotten.
Use a breadth-first search (BFS) algorithm to solve the problem
Create a queue to store the coordinates of rotten oranges
Iterate through the grid and enqueue all rotten oranges
While the queue is not empty, dequeue an orange and check its neighboring oranges
If a neighboring orange is fresh, make it rotte...
Skills evaluated in this interview
Anonymous
Selected
I applied via Naukri.com and was interviewed before Mar 2023. There were 3 interview rounds.
Need Good DSA understanding
Need good DSA Handson
(2 Questions)
- Q1. Machince Coding
- Q2. Design of Split Wise
- Ans.
Split Wise is a mobile app that helps friends and roommates split bills and expenses.
Allows users to create groups and add expenses
Calculates each user's share of the expenses
Provides options for settling debts within the group
Sends notifications for pending payments
Supports multiple currencies for international users
Skills evaluated in this interview
Top trending discussions
Interview questions from similar companies
Interview Questionnaire
17 Questions
- Q1. Find if a string is substring of other string
- Ans.
The function checks if a string is a substring of another string.
Use the built-in string methods like 'indexOf' or 'includes' to check for substring.
If the language supports regular expressions, you can also use them to find substrings.
Consider the case sensitivity of the strings when comparing.
- Q2. Write a code to multiply two matrices of dimension M*N and N*K
- Ans.
Code to multiply two matrices of dimension M*N and N*K.
Create a result matrix of dimension M*K.
Iterate through each row of the first matrix.
For each row, iterate through each column of the second matrix.
For each element in the row of the first matrix, multiply it with the corresponding element in the column of the second matrix.
Sum up the products and store the result in the corresponding position of the result matrix.
...
- Q3. Write a Sql to perform Matrix Multiplication.Two tables has three columns row,col and value
- Ans.
SQL query to perform matrix multiplication using two tables with row, col, and value columns.
Use JOIN operation to combine the two tables based on matching row and col values.
Use GROUP BY clause to group the result by row and col values.
Use SUM function to calculate the dot product of corresponding row and col values.
Use INSERT INTO statement to insert the result into a new table.
- Q4. What is prototype in javascript?
- Ans.
Prototype in JavaScript is an object that is associated with every function and object by default.
Prototype is used to add properties and methods to an object.
It allows objects to inherit properties and methods from other objects.
Modifying the prototype of a function affects all instances of that function.
Prototypes can be used to create new objects based on existing objects.
The prototype chain allows for property and
- Q5. How do we write classes in javascript?
- Ans.
Classes in JavaScript are written using the class keyword.
Use the class keyword followed by the class name to define a class.
Use the constructor method to initialize class properties.
Add methods to the class using the class prototype.
Use the new keyword to create an instance of the class.
- Q6. There is a ladder of N steps.We can either take 1 step or 2 steps.In how many different ways one can climb the ladder?
- Ans.
The number of different ways to climb a ladder of N steps by taking 1 or 2 steps at a time.
This is a classic problem that can be solved using dynamic programming.
The number of ways to climb N steps is equal to the sum of the number of ways to climb N-1 steps and N-2 steps.
The base cases are when N is 0 or 1, where there is only 1 way to climb the ladder.
For example, for N=4, there are 5 different ways: [1, 1, 1, 1], [1
- Q7. Print a square matrix in spiral order
- Ans.
Print a square matrix in spiral order
Start by defining the boundaries of the matrix
Iterate through the matrix in a spiral pattern, printing each element
Adjust the boundaries after each iteration to move inward
Repeat until all elements are printed
- Q8. Given a table with 3 columns StudentName,Subject and Marks.Write a sql to retrieve second highest Marks Obtained for each student
- Ans.
Retrieve the second highest marks obtained by each student from a table with student name, subject, and marks.
Use the RANK() function to assign a rank to each row based on the marks in descending order.
Filter the result to only include rows with rank 2 for each student.
Group the result by student name to get the second highest marks for each student.
- Q9. Given a Website with header,footer,side ads(Google ads,Internal ads).How will you extract only useful data from the page
- Q10. Difference between .live() and .delegate() in jquery
- Ans.
The .live() method attaches an event handler to the current and future elements, while .delegate() attaches an event handler to a parent element.
The .live() method is deprecated in newer versions of jQuery.
The .delegate() method is preferred over .live() for performance reasons.
Both methods are used to handle events for dynamically added elements.
Example: $(document).live('click', 'button', function() { ... });
Example:...
- Q11. What is chaining in jquery?
- Ans.
Chaining in jQuery allows multiple methods to be called on a single element in a single line of code.
Chaining simplifies code and improves readability.
Each method in the chain operates on the result of the previous method.
The chain ends with a method that does not return a jQuery object.
Example: $('div').addClass('highlight').fadeOut();
- Q12. What is callback function?
- Ans.
A callback function is a function that is passed as an argument to another function and is executed later.
Callback functions are commonly used in event-driven programming.
They allow asynchronous execution of code.
Callback functions can be used to handle responses from APIs or user interactions.
They can be anonymous functions or named functions.
Example: setTimeout(function() { console.log('Hello!'); }, 1000);
- Q13. What is .bind() function in jquery?
- Ans.
The .bind() function in jQuery is used to attach an event handler function to one or more elements.
It allows you to specify the event type and the function to be executed when the event occurs.
The .bind() function can be used to bind multiple events to the same element.
It can also be used to pass additional data to the event handler function.
The .bind() function is deprecated in jQuery version 3.0 and above. It is reco
- Q14. Find the angle between hour handle and minute handle in a clock
- Ans.
The angle between the hour and minute hands of a clock can be calculated using a formula.
The hour hand moves 30 degrees per hour and 0.5 degrees per minute.
The minute hand moves 6 degrees per minute.
Calculate the angle between the two hands using the formula: |30H - 11M/2|, where H is the hour and M is the minute.
- Q15. Is it possible to create slideshow without using javascript
- Ans.
Yes, it is possible to create a slideshow without using JavaScript.
Use CSS animations and transitions to create the slideshow.
Use HTML and CSS to structure and style the slideshow.
Utilize keyframe animations to create the slide transitions.
Use radio buttons or checkboxes to control the slideshow navigation.
Apply the :target pseudo-class to create a simple slideshow without JavaScript.
- Q16. Questions about my current project and academic project
- Q17. Given two points A and B with distance between them lets say D.there are N men who want to go from point A to point B.All men walk with same speed.They also have one scooter with them which has speed grea...
- Ans.
The men can take turns riding the scooter, allowing them to reach point B faster.
The men can form a queue and take turns riding the scooter.
The person riding the scooter can drop it off at a certain point and the next person can pick it up.
The scooter can be passed along the line of men until everyone reaches point B.
Interview Preparation Tips
College Name: na
Skills evaluated in this interview
Interview Preparation Tips
Skills: Java, Data structures, Algorithm
College Name: na
Interview Preparation Tips
Experience: 1. Rotate a matrix by 90 degrees clockwise.( He asked me have you heard of question.I said Yes.Then he asked me to code)2. Find vertical sum of nodes present in same vertical line in binary tree. ( He again asked me have you heard of question. I have heard it but didn’t remember the approach. It took some time and then I started telling my approach.He aasked me to write code and question regarding get sums from left to right , for which I made use of linked hashmap)
Overall It was very cool for me
Total Questions: 2
Round: Test
Experience: 1.Reverse K blocks of nodes in linked list.There are two interviewers this time, probably, guy was senior he was asking me question.He was very particular in coding. Checked every edge case.and asked me evrything.Initially I told the approach and then started coding.2.Find min in stack in O(1)Pretty straightforward written code.Again he checked all edge cases with my code.3. Then asked about counting sort and its code.4. And a simple question on array sorting.
Round: HR Interview
Experience: I thought this was last round as they have said like.She asked me about my strengths and challenges I faced.How I overcame through it1.Basic question on oops concepts.(runtime polymorphism).
2.Design tables for getting all employees under manager. I screwed it little bit.But some how I got answer which I was not satisfied as well.I was expecting result either yes/no.But they called me for another round of interview may be because of my expected salary which was high compared to my previous.
Round: Technical Interview
Experience: 1.Given “aaabbbccc” it should return “a3b3c3″ in place. Initially I explained brute force approach then he said array has 2n space.I was able to remember approach for quicksort and started explaining after which I grew confident on it.He was satisfied.Questions on time complexity of algo and space complexity discussions.2.Again a question on OOPs.This time I was completely wrong in answering it.I thought interview with yatra was closing for me.He was not satisified much with this.Luckily, there was another round with manager.
Round: Other Interview
Experience: 1.He asked me to find words which are having particular pattern.Then I said it was KMP algo. Can I explain it ?? I started explaining approach, may be he was busy with something, he asked me to write pseudo code.He left the room for 15 mins then he came back I had almost completed the code, which he was satisified.Some basic questions on spring ( my previous work was related to it). Then my expected salary and my position If I got selected in yatra were discussed.
College Name: NA
Interview Preparation Tips
Experience: The interviewers were professional in their approach and ensured that I was comfortable through the whole process.
General Tips: Interview process was fairly fast but a bit heavy. There were 4 technical interviews and 1 HR. It turns out to be not too difficult as some questions are duplicated in all the interviews.
Skills: Algorithm, data structure
College Name: na
I was interviewed before Sep 2020.
(1 Question)
Round duration - 75 minutes
Round difficulty - Easy
This was the online round held at university. All students who met the eligibility criteria were called for the online test on hackerrank.
- Q1.
Anagram Difference Problem Statement
Given two strings, 'STR1' and 'STR2', of equal lengths, determine the minimum number of manipulations required to make the two strings anagrams of each other.
Input:
... - Ans.
The problem involves finding the minimum number of manipulations required to make two strings anagrams of each other.
Create frequency maps for both strings
Find the absolute difference in frequencies of each character
Sum up the absolute differences to get the total manipulations needed
(1 Question)
Round duration - 90 Minutes
Round difficulty - Medium
This round was technical round and the interview started with formal introduction and general questions.
After that We had a discussion on LRU Cache.
Followed by coding and set of data structure questions.
- Q1.
Gas Tank Problem Statement
You have a car with a gas tank of infinite capacity. There are 'N' gas stations located along a circular route, numbered from 0 to N-1. You begin your journey with an empty tank...
- Ans.
Find the starting gas station index to complete a circular route with gas and cost arrays.
Iterate through gas stations, keeping track of total gas and total cost from each station
If total gas is greater than or equal to total cost, update the starting station index
Return the starting station index if a valid one is found, else return -1
(2 Questions)
Round duration - 90 minutes
Round difficulty - Medium
This Round was DS and Algo round and it started with formal introduction, followed by 2 problems. We first dicussed the approach the time complexity and proper code covering all cases.
- Q1.
Boundary Traversal of Binary Tree
Given a binary tree of integers, your task is to print the boundary nodes of this binary tree in an anti-clockwise direction starting from the root node.
Input:
The fir... - Ans.
Print the boundary nodes of a binary tree in an anti-clockwise direction starting from the root node.
Traverse the left boundary nodes from the root to the leftmost leaf node.
Traverse the leaf nodes from left to right.
Traverse the right boundary nodes from the rightmost leaf node to the root.
- Q2.
Maximum Sum of Two Non-Overlapping Subarrays
Given an integer array
ARRand a positive integerK, your objective is to find two non-overlapping subarrays (contiguous) of lengthKeach, such that their sum... - Ans.
Find two non-overlapping subarrays of length K with maximum sum in an integer array.
Iterate through the array to find all possible subarrays of length K.
Calculate the sum of each pair of non-overlapping subarrays of length K.
Keep track of the maximum sum obtained from the pairs of subarrays.
Round duration - 30 minutes
Round difficulty - Easy
This was the Final Interview and it started with formal introduction and general HR questions. Then We discussed about the projects and the things written in my resume. The interviewer was very frank and this round was very interactive. He asked me about my college, my future plans, teachers, various subjects, why Expedia and questions like that.
Interview Preparation Tips
Tip 1 : Be solid with the basics of Ds & Algorithms. Good to have end to end projects which are hosted on cloud.
Tip 2 : Its always good to be presentable and have good communications skills
Tip 3 : Be honest, clear in approach and always walkthrough your thought process to the interviewer
Tip 1: Mention your projects and experience at the top. Be clear on what was done, a brief on how it was done, language /tech stack involved. If possible try to host and make it accessible. You never know if you can present it with just one click.
Tip 2: Choose a balance between, white spaces and text, it should be well indented, no grammatical errors.
Tip 3: It takes less than 2 min to scan a resume. Don't mention things which are irrelevant.
Skills evaluated in this interview
I was interviewed before Jan 2021.
(2 Questions)
Round duration - 120 minutes
Round difficulty - Easy
The test was divided into two parts : Section A had questions from Quantitative, C language, Logical and English. The second part had two coding questions.
- Q1.
Deletion in Circular Linked List Problem Statement
Given a Circular Singly Linked List of integers, and a specific value 'VAL', your task is to delete the first occurrence of this value in the linked list...
- Ans.
Delete the first occurrence of a specific value in a Circular Linked List.
Traverse the circular linked list to find the value to be deleted.
Update the pointers to skip the node containing the value.
Handle edge cases like deleting the only node in the list.
Return the modified circular linked list.
- Q2.
LRU Cache Design Question
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1.
get(key)- Return the value of the key if it exists in the cache; otherw... - Ans.
Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraints.
Use a combination of a doubly linked list and a hashmap to efficiently implement the LRU cache.
Keep track of the least recently used item and update it accordingly when new items are added.
Ensure that the cache does not exceed its capacity by evicting the least recently used item when necessary.
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
I was interviewed before Jan 2021.
(2 Questions)
Round duration - 120 minutes
Round difficulty - Easy
Hello everyone! Expedia came to our campus for full time hiring of final year students. They had shortlisted candidates for the interviews by taking an online test comprised of four sections (Quantitative, C, Logical and English). Every section had a timer attached to it, so you need to think and answer quickly. Although, the questions were easy but cutoff was quite high. This round was followed by a coding round, comprised of two questions.
- Q1.
Problem: Deletion in Circular Linked List
You are provided with a Circular Linked List of integers and a specific integer, referred to as
'key'.Your task is to implement a function that locates the spec...
- Ans.
Implement a function to delete a specific key from a Circular Linked List of integers.
Traverse the Circular Linked List to find the key to be deleted.
Adjust the pointers to remove the node containing the key.
Handle the case where the Circular Linked List becomes empty after deletion.
Return -1 if the Circular Linked List is empty after deletion.
- Q2.
Page Faults Identification Problem Statement
In computing, a page fault occurs when a process accesses a memory page that is not currently mapped by the memory management unit. To handle new pages being b...
- Ans.
The problem involves determining the number of page faults using the Least Recently Used (LRU) replacement algorithm.
Page faults occur when a process accesses a memory page not currently mapped by the memory management unit.
Page replacement algorithm like LRU is used to decide which existing page should be replaced.
The goal is to calculate the number of page faults based on the given input sequences and memory capacity...
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
The man who was taking my first round was my alumni. He started-off by asking my introduction and then gave me 2 programming questions to code. He then navigated on to my Codechef profile and asked a question that I did in the June 14 Long Contest. I explained him and he was satisfied.
Tips : You don’t have to answer the stuffs quickly, rather you need to develop some test cases and have some discussion regarding the structure of the problem, and then answer.
- Q1.
Cycle Detection in a Singly Linked List
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's
nextpoints back to a previous node in the ... - Ans.
Detect if a singly linked list forms a cycle by checking if a node's next points back to a previous node.
Traverse the linked list using two pointers, one moving one step at a time and the other moving two steps at a time.
If the two pointers meet at any point, it indicates the presence of a cycle in the linked list.
Use Floyd's Cycle Detection Algorithm for efficient detection of cycles in a linked list.
- Q2.
Closest Sum Problem Statement
Given an array of integers
ARRof sizeNand an integertarget, find three integers inARRsuch that their sum is closest to thetarget. If there are two closest sums, return... - Ans.
Find three integers in an array whose sum is closest to a given target, return the smallest sum if there are two closest sums.
Iterate through all possible triplets in the array to find the sum closest to the target.
Keep track of the closest sum found so far and update it if a closer sum is found.
Return the closest sum at the end of the iteration.
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
I applied via Other and was interviewed in Sep 2018. There were 3 interview rounds.
Interview Questionnaire
5 Questions
- Q1. As position was for UI developer. So first round was majorly based on HTML and CSS. They were checking the basic concepts.
- Q2. Questions from JavaScript. Major JavaScript concepts and logical questions.
- Q3. Main focus was on data structure, travel domain knowledge and optimisation techniques.
- Q4. Main purpose of this round was to check how updated a person is with new technologies, his willingness to learn new things and attitude towards work.
- Q5. General discussion and salary negotiation.
Interview Preparation Tips
Skills: GIT, Css, HTML, JavaScript, Communication
Duration: <1 week
MakeMyTrip Interview FAQs
Recently Viewed
DESIGNATION
INTERVIEWS
Delhi Professional Courses Academy
No Interviews
INTERVIEWS
MakeMyTrip
No Interviews
INTERVIEWS
Salesforce
No Interviews
INTERVIEWS
MakeMyTrip
No Interviews
INTERVIEWS
MakeMyTrip
No Interviews
JOBS
Hubert Enviro Care Systems
No Jobs
INTERVIEWS
Salesforce
No Interviews
INTERVIEWS
MakeMyTrip
No Interviews
INTERVIEWS
Salesforce
No Interviews
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 Full Stack Developer Interview Questions
- MakeMyTrip Senior Software Engineer 2 Interview Questions
- Show more
Interview Questions for Popular Designations
- Software Developer Interview Questions
- Associate Software Developer Interview Questions
- Lead Software Engineer Interview Questions
- Software Development Engineer II Interview Questions
- Software Engineer Interview Questions
- Software Development Engineer 1 Interview Questions
- Software Engineer Level 1 Interview Questions
- Java Software Developer Interview Questions
- Show more
MakeMyTrip Senior Software Developer Interview Process
based on 2 interviews
Interview experience
Interview Questions from Similar Companies
Fast track your campus placements
MakeMyTrip Senior Software Developer Reviews and Ratings
based on 1 review
Rating in categories
|
Senior Software Engineer
322
salaries
|  ₹0 L/yr - ₹0 L/yr |
|
Assistant Manager
268
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Holiday Expert
225
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Senior Business Development Manager
220
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Senior Executive
210
salaries
| ₹0 L/yr - ₹0 L/yr |
Cleartrip
Yatra
Goibibo
Oyo Rooms
- Home >
- Interviews >
- MakeMyTrip Interview Questions >
- MakeMyTrip Senior Software Developer Interview Questions
