MakeMyTrip Java Developer Interview Questions
& Process
Real candidates share what happened, how many rounds they had,
and how the experience turned out.
Based on 8 interview experiences · FREE TO READ
Candidate interview experiences
First-hand accounts from people who interviewed at MakeMyTrip.
MakeMyTrip
Java Developer
Entry Average Negative experience No offer 3 rounds
Interview process
Technical screen Onsite Group
Interview formats
Technical Coding
The interview process had about 2-3 rounds. The first round was an online test with technical and aptitude questions that had to be completed from home. If you passed that, you'd be called for a technical interview. However, when I was called for the interview at the Gurgaon HQ, it wasn't conducted as expected. Around 10-12 candidates were there, resumes were collected, and we were called one by one randomly. Each interview lasted 10-20 minutes. When only 4 candidates were left, including me, we were called together. We were given a difficult question and 15 minutes to solve it. After 5 minutes, they took the sheets back, saying time was up. We waited from 1 PM to 6 PM for results, but were eventually told to go home and that they would inform us. The whole experience felt highly unprofessional and partial, like a joke.
Confirmed questions1 question
- Nothing specific was asked, it was a waste of time.
MakeMyTrip
Senior Java Developer
Senior Average Negative experience No offer 1 round
Interview process
Recruiter call Technical screen
Interview formats
Technical Coding Behavioral
It was a really bad experience. I had to wait 2 hours for the first round. The interviewer was handling two interviews at the same time in different rooms. He asked me about my projects and then gave me two data structure problems involving trees and linked lists. I managed to solve both, but still wasn't selected. When I asked the recruiter why, they said it also depends on the interviewer's mood. It was totally unprofessional and a waste of time.
Confirmed questions3 questions
- Tell me about your projects.
- Can you solve a problem involving a Binary Search Tree?
- How would you find the maximum sum subsequence in an array?
MakeMyTrip
Java Developer
Mid Average Positive experience No offer 3 rounds
Interview process
Technical screen Technical screen Background check
Interview formats
Technical Coding
The interview process included two technical rounds and one HR round. The questions covered Java and data structures. The overall interview process was not very difficult, and the data structure questions were also quite manageable.
Confirmed questions3 questions
- How would you implement a HashMap in Java, explaining how keys are uniquely identified and how values are inserted based on keys?
- If you're given an array of size n with duplicate elements, and the elements are not greater than n, how would you sort the array based on the frequency of each number? For example, for the input [4,3,4,3,3,2,1,1,3,5,6,3,2,1], the output should be [5,6,2,2,4,4,1,1,1,3,3,3,3,3].
- What are the common words found in these three statements: 'MMT is best company', 'MMT is travel company', and 'MMT is safe for women'?
MakeMyTrip Java Developer Interview Questions
Quoted word for word from MakeMyTrip interview reports.
“What's the difference between declaring a String as 'String str = "abc"' versus 'String str = new String("abc")'?”
Read reports →“Is it possible to prevent a .js file from being downloaded within a jsp?”
Read reports →“How does the String object behave within the string pool?”
Read reports →“Given a compressed string (e.g., 'a4bc3') and an index, how would you determine the character at that specific index in the original, uncompressed string without decompressing the entire string?”
Read reports →“Why is the String class immutable, and what is the practical need for this immutability?”
Read report →“Is the Singleton object managed by Spring the same as a Singleton pattern implemented directly in Java?”
Read report →“How would you find duplicate elements in an array in O(n) time and O(1) extra space?”
Read report →“If you're given an array of size n with duplicate elements, and the elements are not greater than n, how would you sort the array based on the frequency of each number? For example, for the input [4,3,4,3,3,2,1,1,3,5,6,3,2,1], the output should be [5,6,2,2,4,4,1,1,1,3,3,3,3,3].”
Read report →“What modifications are necessary for a custom class if you intend to use objects of that class as keys in a HashMap?”
Read report →Formats, difficulty and experience
Across all 8 MakeMyTrip interview reports.