Makemytrip

Role: Software Engineer

College: Not Specified

Interview Date: July 15, 2025

Interview Type: Full-Time

Result: Not Specified

Difficulty: Not Specified

Rounds: 4 rounds

Topics Asked: Projects, OS (shell commands), Data Structures (Longest repeating substring, max j-i such that arr[j]>arr[i], path finding in binary matrix, hashmap problems, BST check), Algorithms, OOPs

Experience:

This interview process for a Software Engineer role at MakeMyTrip consisted of four rounds.

Round 1: Online Assessment (HackerEarth)
This round included 8 MCQs and 2 algorithmic coding questions. One coding question involved determining if a target coordinate (x,y) could be reached from (1,1) using specific moves (a+b,b) or (a,a+b). The second coding question was about dividing a tree along an edge to minimize the difference between the sums of node values on either side.

Round 2: Technical Interview - 1
The interviewer started with a discussion about projects listed in the resume and summer internship experience. Questions were asked about the operating system used, specifically shell commands for Linux users. A Data Structures question involved finding the longest repeating substring in a string, for which both a brute-force and an optimized hashmap approach were discussed. Another DS question required finding the maximum j-i such that arr[j] > arr[i] in an array, with an O(n) time and O(n) space solution provided. Other problems included a path-finding problem in a binary matrix using backtracking, a hashmap-based problem to find pairs in two arrays summing to K, and checking if a binary tree is a Binary Search Tree (BST).

Round 3: Technical Interview - 2
This round primarily focused on a discussion of Object-Oriented Programming (OOPs) concepts.

Round 4: HR Round
Details for this round were not extensively provided, but it typically covers general HR-related inquiries.