Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by MakeMyTrip Team. If you also belong to the team, you can get access from here

MakeMyTrip Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

MakeMyTrip Software Development Engineer II Interview Questions and Answers

Updated 20 Jun 2024

MakeMyTrip Software Development Engineer II Interview Experiences

1 interview found

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - DSA 

(2 Questions)

  • Q1. Number of buildings from n coins
  • Ans. 

    The number of buildings that can be built using n coins can be calculated using a mathematical formula.

    • Use the formula: number of buildings = floor(sqrt(2 * n + 0.25) - 0.5)

    • For example, if n = 5, then number of buildings = floor(sqrt(2 * 5 + 0.25) - 0.5) = floor(sqrt(10.25) - 0.5) = floor(3.2) = 3

  • Answered by AI
  • Q2. Get a maximum sum from picking corner elements
  • Ans. 

    Find the maximum sum by picking corner elements of a matrix

    • Start by selecting the four corner elements of the matrix

    • Compare the sum of the diagonally opposite corners and choose the pair with the higher sum

    • Repeat the process with the remaining elements until all corners are picked

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - DSA round 1:
2 questions were asked
1. Calculate number of buildings can be build from N coins when
from 1 coin required to build 1 building, 2 coins required for busling 2nd building, 3 coins required to build 3rd building,...

2. We have any array
2, 6, 4, 0, 9,1,5
we need to pick one element from left and one element from right i.e. extreme corners up to k times. get maximum sum.

Skills evaluated in this interview

Top trending discussions

View All
Salary Discussions, Hike & Promotions
2w
a senior executive
GF salary Vs. My salary
Me and my gf have been dating for 5 years. Back in 2020, I started my career with a package of ₹5 LPA. Over the years, I’ve reached ₹22 LPA in 2025. She started her journey with ₹3 LPA(2020) and is now earning ₹8 LPA(2025). We’ve been in a live-in relationship for around 2 years, and the idea was to share expenses equally. But, equal sharing never really happened. If we go to a café she likes, especially with friends, I will pay the entire bill. We only split the house rent and grocery bills. I told her lots of time to cut down these costly cafe expenses or earn more money, increase your package, study and work hard, but.....she is now in her comfort zone. Being from a tech background, I have seen people upgrade their skills and package for a good life in metro cities. I am ready to support her in her studies, but she is like I am earning enough for myself.... No, you are not. I love her, but I don't know how to overcome this issue between us. Please suggest!
Got a question about MakeMyTrip?
Ask anonymously on communities.

Interview questions from similar companies

I appeared for an interview before Jan 2021.

Round 1 - Coding Test 

(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 A containing 'N' integers and an integer m, rearrange the elements of the array such that the differences between the array elements and m are 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.

  • Answered by AI
  • 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

  • Answered by AI
Round 2 - Face to Face 

(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
    4567654

    Explanation:

    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

  • Answered by AI
  • 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...

  • Answered by AI
  • 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...

  • Answered by AI
  • 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

  • Answered by AI
Round 3 - HR 

Round duration - 30 minutes
Round difficulty - Easy

Typical HR round with behavioral problems.

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from Chitkara University. Eligibility criteriaAbove 7 CGPAInfo Edge India (Naukri.com) interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

Software Development Engineer II Interview Questions Asked at Other Companies

asked in Zepto
Q1. Given two large numeric comma-separated strings, calculate their ... read more
asked in Pine Labs
Q2. Design a system like Redbus with the following functional require ... read more
asked in Zepto
Q3. Design a file system similar to Google Drive, including file uplo ... read more
asked in Porter
Q4. 1. Given an array find a subset that sums to a given sum K 2. Giv ... read more
asked in Zepto
Q5. How many microservices do you own and at what scale do they handl ... read more

I applied via Campus Placement

Interview Preparation Tips

Round: Resume Shortlist
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

  • Answered by AI
  • Q3. Reverse a singly linked list in groups of k in­place
  • Ans. 

    Reverse a singly linked list in groups of k in­place

    • 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

  • Answered by AI
  • 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

  • Answered by AI
  • 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...

  • Answered by AI

Interview Preparation Tips

Skills:
College Name: NA

Skills evaluated in this interview

Software Engineer Interview Questions & Answers

Amazon user image Rajesh Paramanandam

posted on 24 Feb 2017

I appeared for an interview in Oct 2016.

Interview Preparation Tips

Round: Test
Experience: Aptitude was quite easy they just asked us basic questions from Math,logical reasoning and english
Tips: Just think well before u do..
Duration: 1 hour 30 minutes
Total Questions: 40

Round: Behavioural Interview
Experience: It was face to face .. the interviewee asked questions from our resume... Since I m from computer science background they asked some technical questions..

Tips: Beware filling ur resume.. they will ask every stuff that you have in resume

Round: Technical Interview
Experience: Discussion about my project that i vr done in my final year.they asked me what was my role in my project

College Name: Sri ganesh college of engineering and technology

Interview Preparation Tips

Round: Test
Duration: 2 hours
Total Questions: 22

College Name: Jaypee University Of Information Technology, Solan

Interview Preparation Tips

Round: Test
Experience: The first test
contained 25 objective questions encompassing the basics of Computer Science ranging from
data structures, networks and operating systems to theory of computation
Duration: 45 minutes
Total Questions: 25

Round: Test
Experience: The second test contained 3 coding questions.
Duration: 45 minutes
Total Questions: 3

Round: HR Interview
Experience: After the written test, next day I appeared for 3 interviews.
They were checking if you can write code and also if you are aware of the practical issues faced while coding. In the final round they were testing if you could abstract out a real world
problem into code.
Tips: Overall I can say that you must hope for the best and prepare for the
worst. So make sure that you are prepared on all counts. You never know what might go wrong.

Are these interview questions helpful?

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.

  • Answered by AI
  • 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.

  • Answered by AI
  • 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

  • Answered by AI
  • 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.

  • Answered by AI
  • 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

  • Answered by AI

Interview Preparation Tips

Round: Technical Interview
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

Round: Test
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)

Interview Questionnaire 

2 Questions

  • Q1. Data struct,algo,
  • Q2. High level data structs and algos

Interview Preparation Tips

Round: Problem Statement
Experience: coding and submission before face to face interview shortlisting
Tips: practice coding ,coding is key to success for SE

Round: Resume Shortlist
Experience: based on marks ,I was called for F2F
Tips: the ppt was to be submitted explaining the approach

Round: Technical Interview
Experience: a lot of brain storming
Tips: understands the nitty gritty of the structs and algos

Round: Technical Interview
Experience: exact code was to be written instead of pseudo code
Tips: get hold of DS,Algos

MakeMyTrip Interview FAQs

What are the top questions asked in MakeMyTrip Software Development Engineer II interview?

Some of the top questions asked at the MakeMyTrip Software Development Engineer II interview -

  1. get a maximum sum from picking corner eleme...read more
  2. number of buildings from n co...read more

Tell us how to improve this page.

Overall Interview Experience Rating

5/5

based on 1 interview experience

MakeMyTrip Software Development Engineer II Salary
based on 7 salaries
₹19.3 L/yr - ₹30 L/yr
19% less than the average Software Development Engineer II Salary in India
View more details

MakeMyTrip Software Development Engineer II Reviews and Ratings

based on 1 review

3.0/5

Rating in categories

3.0

Skill development

3.0

Work-life balance

3.0

Salary

4.0

Job security

3.0

Company culture

3.0

Promotions

3.0

Work satisfaction

Explore 1 Review and Rating
Senior Software Engineer
335 salaries
unlock blur

₹19 L/yr - ₹33 L/yr

Assistant Manager
282 salaries
unlock blur

₹9 L/yr - ₹15.7 L/yr

Software Engineer
254 salaries
unlock blur

₹8 L/yr - ₹26 L/yr

Holiday Expert
235 salaries
unlock blur

₹2 L/yr - ₹6.1 L/yr

Senior Business Development Manager
221 salaries
unlock blur

₹5.4 L/yr - ₹11.7 L/yr

Explore more salaries
Compare MakeMyTrip with

Cleartrip

3.5
Compare

Amazon

4.0
Compare

Flipkart

3.9
Compare

Indiamart Intermesh

3.6
Compare
write
Share an Interview