Problem database last updated: June 20, 2025
28 problems · 1 Easy, 20 Medium, 7 Hard · Ranked #71 of 458
1 Easy
4% · avg 23%
20 Medium
71% · avg 59%
7 Hard
25% · avg 18%
Based on 28 reported problems, MakeMyTrip interviews are slightly harder than average - 25% Hard vs 18% across all companies. The majority (71%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.
Compared to the industry average, MakeMyTrip puts unusual emphasis on shortest-path (7.1% of problems, 14.3x the industry average), graph (10.7% of problems, 3.6x the industry average), sliding-window (14.3% of problems, 3x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (57.1%), string (39.3%), dynamic-programming (35.7%), hash-table (32.1%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Length of Longest Subarray With at Most K Frequency You are given an integer array nums and an integer k. | Medium | Very Likely | arrayhash-tablesliding-window | Solve |
Longest Ideal Subsequence You are given a string s consisting of lowercase letters and an integer k. We call a string t ideal if the following conditions are satisfied: | Medium | Very Likely | hash-tablestringdynamic-programming | Solve |
Reachable Nodes With Restrictions There is an undirected tree with n nodes labeled from 0 to n - 1 and n - 1 edges. | Medium | Very Likely | arrayhash-tabletree | Solve |
First Missing Positive Given an unsorted integer array nums. Return the smallest positive integer that is not present in nums. | Hard | Very Likely | arrayhash-table | Solve |
Cheapest Flights Within K Stops There are n cities connected by some number of flights. You are given an array flights where flights[i] = [fromi, toi, pricei] indicates that there is a flight... | Medium | Very Likely | dynamic-programmingdepth-first-searchbreadth-first-search | Solve |
Minimum Window Substring Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every character in t (including duplicates) is inc... | Hard | Likely | hash-tablestringsliding-window | Solve |
Jump Game You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length... | Medium | Likely | arraydynamic-programminggreedy | Solve |
Trapping Rain Water Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining. | Hard | Likely | arraytwo-pointersdynamic-programming | Solve |
Merge Intervals Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cove... | Medium | Likely | arraysorting | Solve |
Longest Substring Without Repeating Characters Given a string s, find the length of the longest substring without duplicate characters. | Medium | Likely | hash-tablestringsliding-window | Solve |
Word Search Given an m x n grid of characters board and a string word, return true if word exists in the grid. | Medium | Likely | arraystringbacktracking | Solve |
Insert Delete GetRandom O(1) Implement the RandomizedSet class: | Medium | Likely | arrayhash-tablemath | Solve |
Regular Expression Matching Given an input string s and a pattern p, implement regular expression matching with support for '.' and '' where: | Hard | Likely | stringdynamic-programmingrecursion | Solve |
Implement Trie (Prefix Tree) A trie (pronounced as "try") or prefix tree is a tree data structure used to efficiently store and retrieve keys in a dataset of strings. There are various appl... | Medium | Likely | hash-tablestringdesign | Solve |
Sliding Window Maximum You are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see... | Hard | Likely | arrayqueuesliding-window | Solve |
Evaluate Division You are given an array of variable pairs equations and an array of real numbers values, where equations[i] = [Ai, Bi] and values[i] represent the equation Ai /... | Medium | Likely | arraystringdepth-first-search | Solve |
Search a 2D Matrix II Write an efficient algorithm that searches for a value target in an m x n integer matrix matrix. This matrix has the following properties: | Medium | Likely | arraybinary-searchdivide-and-conquer | Solve |
Min Stack Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. | Medium | Likely | stackdesign | Solve |
Increasing Triplet Subsequence Given an integer array nums, return true if there exists a triple of indices (i, j, k) such that i < j < k and nums[i] < nums[j] < nums[k]. If no such indices e... | Medium | Likely | arraygreedy | Solve |
Longest Valid Parentheses Given a string containing just the characters '(' and ')', return the length of the longest valid (well-formed) parentheses substring. | Hard | Likely | stringdynamic-programmingstack | Solve |
Longest Palindromic Substring Given a string s, return the longest palindromic substring in s. | Medium | Likely | two-pointersstringdynamic-programming | Solve |
Majority Element Given an array nums of size n, return the majority element. | Easy | Likely | arrayhash-tabledivide-and-conquer | Solve |
Product of Array Except Self Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i]. | Medium | Likely | arrayprefix-sum | Solve |
Find First and Last Position of Element in Sorted Array Given an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target value. | Medium | Likely | arraybinary-search | Solve |
Edit Distance Given two strings word1 and word2, return the minimum number of operations required to convert word1 to word2. | Medium | Likely | stringdynamic-programming | Solve |
Generate Parentheses Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. | Medium | Likely | stringdynamic-programmingbacktracking | Solve |
Jump Game II You are given a 0-indexed array of integers nums of length n. You are initially positioned at index 0. | Medium | Likely | arraydynamic-programminggreedy | Solve |
Reverse Nodes in k-Group Given the head of a linked list, reverse the nodes of the list k at a time, and return the modified list. | Hard | Likely | linked-listrecursion | Solve |
Length of Longest Subarray With at Most K Frequency
SolveYou are given an integer array nums and an integer k.
Longest Ideal Subsequence
SolveYou are given a string s consisting of lowercase letters and an integer k. We call a string t ideal if the following conditions are satisfied:
Reachable Nodes With Restrictions
SolveThere is an undirected tree with n nodes labeled from 0 to n - 1 and n - 1 edges.
First Missing Positive
SolveGiven an unsorted integer array nums. Return the smallest positive integer that is not present in nums.
Cheapest Flights Within K Stops
SolveThere are n cities connected by some number of flights. You are given an array flights where flights[i] = [fromi, toi, pricei] indicates that there is a flight...
Minimum Window Substring
SolveGiven two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every character in t (including duplicates) is inc...
Jump Game
SolveYou are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length...
Trapping Rain Water
SolveGiven n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.
Merge Intervals
SolveGiven an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cove...
Longest Substring Without Repeating Characters
SolveGiven a string s, find the length of the longest substring without duplicate characters.
Word Search
SolveGiven an m x n grid of characters board and a string word, return true if word exists in the grid.
Regular Expression Matching
SolveGiven an input string s and a pattern p, implement regular expression matching with support for '.' and '' where:
Implement Trie (Prefix Tree)
SolveA trie (pronounced as "try") or prefix tree is a tree data structure used to efficiently store and retrieve keys in a dataset of strings. There are various appl...
Sliding Window Maximum
SolveYou are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see...
Evaluate Division
SolveYou are given an array of variable pairs equations and an array of real numbers values, where equations[i] = [Ai, Bi] and values[i] represent the equation Ai /...
Search a 2D Matrix II
SolveWrite an efficient algorithm that searches for a value target in an m x n integer matrix matrix. This matrix has the following properties:
Min Stack
SolveDesign a stack that supports push, pop, top, and retrieving the minimum element in constant time.
Increasing Triplet Subsequence
SolveGiven an integer array nums, return true if there exists a triple of indices (i, j, k) such that i < j < k and nums[i] < nums[j] < nums[k]. If no such indices e...
Longest Valid Parentheses
SolveGiven a string containing just the characters '(' and ')', return the length of the longest valid (well-formed) parentheses substring.
Longest Palindromic Substring
SolveGiven a string s, return the longest palindromic substring in s.
Majority Element
SolveGiven an array nums of size n, return the majority element.
Product of Array Except Self
SolveGiven an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i].
Find First and Last Position of Element in Sorted Array
SolveGiven an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target value.
Edit Distance
SolveGiven two strings word1 and word2, return the minimum number of operations required to convert word1 to word2.
Generate Parentheses
SolveGiven n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.
Jump Game II
SolveYou are given a 0-indexed array of integers nums of length n. You are initially positioned at index 0.
Reverse Nodes in k-Group
SolveGiven the head of a linked list, reverse the nodes of the list k at a time, and return the modified list.
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent MakeMyTrip interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
MakeMyTrip interviews focus heavily on array, string, dynamic-programming problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. MakeMyTrip interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
MakeMyTrip has been reported to ask 28 distinct coding problems. The most common topics are array, string, dynamic-programming. 1 are Easy difficulty, 20 are Medium, and 7 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 28 reported problems, MakeMyTrip interviews are slightly harder than average - 25% Hard vs 18% across all companies. 71% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, string, dynamic-programming. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real MakeMyTrip coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a MakeMyTrip interview with AIarrow_forward
