MakeMyTrip interview experience Real time questions & tips from candidates to crack your interview

Software Engineer

MakeMyTrip
upvote
share-icon
3 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Journey
I was not good at coding at the start of my career, but I practised a lot of questions on coding platforms, which helped me excel in my life and also helped me in coding exams.
Application story
This company visited our campus to hire for the FTE position. From there, I applied for this job opportunity.
Why selected/rejected for the role?
I was rejected because I was not able to give a proper explanation for the questions that were asked.
Preparation
Duration: 3 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip
Tip

Tip 1: Familiarize yourself with basic data structure concepts like arrays, linked lists, stacks, queues, and trees. 

Tip 2: Learn about their properties, operations, and time complexities. 

Tip 3: Attend mock interviews and develop good communication skills.

Application process
Where: Campus
Eligibility: Above 7 CGPA
Resume Tip
Resume tip

Tip 1: Maintain at least two different projects and write a powerful summary statement. 

Tip 2: Highlight skills relevant to the job description and include relevant experience.

Interview rounds

01
Round
Easy
Video Call
Duration60 minutes
Interview date17 May 2023
Coding problem2

Throughout the technical interview, the emphasis was not only on finding the correct solutions but also on the ability to communicate effectively, explain our thought processes, and justify design choices. The interviewers assessed our problem-solving skills, analytical thinking, and overall grasp of DSA and DBMS concepts.

1. Reverse Only Letters

Easy
15m average time
85% success
0/40
Asked in companies
SnapdealAppleOYO

You are given a string, ‘S’. You need to reverse the string where characters that are not an alphabet stay in the same place, and the rest reverse their positions.

Eg: “a-bcd” becomes “d-cba”

Try solving now

2. Count Ways To Travel Triangular Pyramid

Moderate
20m average time
80% success
0/80
Asked in companies
AmazonMicrosoftOYO

Bob has been given a triangular pyramid with its vertices marked as ‘O’, ‘X’, ‘Y’ and ‘Z’ and provided with another integer ‘N’. In a single step, Bob can go to any adjacent vertices. Bob will always start from ‘O’ and has to return to ‘O’ after making exactly ‘N’ steps.

Example

Your task is to find out the number of ways he can take to complete his journey.

Note :

As the answer can be very large, return the answer by taking modulo with 1000000007.

For example :

If ‘N’=1 
So in 1 step we can reach either to ‘X’ , ‘Y’ or ‘Z’ and can not travel back to ‘O’.
Thus there are 0 ways.

If ‘N’ =2
So there are total three ways :
(i)  O->X->O
(ii) O->Y->O
(iii) O->Z->O

If ‘N’ = 3
So there are total 6 ways :
(i) O->X->Y->O
(ii) O->X->Z->O
(iii) O->Y->X->O
(iv) O->Y->Z->O
(v) O->Z->X->O
(vi) O->Z->Y->O
Try solving now
02
Round
Easy
Video Call
Duration60 minutes
Interview date17 May 2023
Coding problem2

1. Boundary Traversal of Binary Tree

Hard
20m average time
85% success
0/120
Asked in companies
MicrosofteBaySalesforce

You are given a binary tree having 'n' nodes.


The boundary nodes of a binary tree include the nodes from the left and right boundaries and the leaf nodes, each node considered once.


Figure out the boundary nodes of this binary tree in an Anti-Clockwise direction starting from the root node.


Example :
Input: Consider the binary tree A as shown in the figure:

alt text

Output: [10, 5, 3, 7, 18, 25, 20]

Explanation: As shown in the figure

The nodes on the left boundary are [10, 5, 3]

The nodes on the right boundary are [10, 20, 25]

The leaf nodes are [3, 7, 18, 25].

Please note that nodes 3 and 25 appear in two places but are considered once.
Try solving now

2. Pair Sum

Easy
15m average time
90% success
0/40
Asked in companies
GrofersOlaJP Morgan

You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to return the list of all pairs of elements such that each sum of elements of each pair equals 'S'.

Note:

Each pair should be sorted i.e the first value should be less than or equals to the second value. 

Return the list of pairs sorted in non-decreasing order of their first value. In case if two pairs have the same first value, the pair with a smaller second value should come first.
Try solving now
03
Round
Easy
HR Round
Duration20 minutes
Interview date17 May 2023
Coding problem1

1. Basic HR Questions

Tell me about yourself.
Why should I hire you?
What are your strengths and weaknesses?

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

Which SQL keyword removes duplicate records from a result set?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
3 rounds | 3 problems
Interviewed by MakeMyTrip
825 views
0 comments
0 upvotes
company logo
Software Engineer
2 rounds | 4 problems
Interviewed by MakeMyTrip
500 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by MakeMyTrip
467 views
0 comments
0 upvotes
company logo
Software Engineer
3 rounds | 7 problems
Interviewed by MakeMyTrip
362 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Software Engineer
3 rounds | 5 problems
Interviewed by Mindtree
11082 views
7 comments
0 upvotes
company logo
Software Engineer
3 rounds | 7 problems
Interviewed by Optum
7001 views
1 comments
0 upvotes
company logo
Software Engineer
5 rounds | 5 problems
Interviewed by Microsoft
8503 views
1 comments
0 upvotes