MakeMyTrip coding interview
questions, leaked.
29 problems reported across recent MakeMyTrip interviews. Top patterns: array, dynamic programming, string. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
MakeMyTrip's coding assessments are array and dynamic-programming heavy. Out of 29 problems in their reported question bank, 17 are array-based and 11 require DP thinking. You're facing a median MEDIUM difficulty (20 out of 29), which means the bar is consistent execution under time pressure, not exotic algorithm tricks. Most candidates who fail do so because they see a string problem and blank on the sliding-window pattern, or they recognize it's a DP problem but can't state the recurrence cleanly. If you hit that wall on the live assessment, StealthCoder runs invisibly behind your screen, reads the problem, and surfaces a working solution in seconds. Your real edge is drilling array and string patterns until they're automatic.
Top problems at MakeMyTrip
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Reachable Nodes With Restrictions | MEDIUM | 100.0 | 60% | Array · Hash Table · Tree |
| 02 | Length of Longest Subarray With at Most K Frequency | MEDIUM | 100.0 | 56% | Array · Hash Table · Sliding Window |
| 03 | Sum Of Special Evenly-Spaced Elements In Array | HARD | 100.0 | 49% | Array · Dynamic Programming |
| 04 | Longest Ideal Subsequence | MEDIUM | 100.0 | 47% | Hash Table · String · Dynamic Programming |
| 05 | First Missing Positive | HARD | 94.4 | 41% | Array · Hash Table |
| 06 | Cheapest Flights Within K Stops | MEDIUM | 82.7 | 40% | Dynamic Programming · Depth-First Search · Breadth-First Search |
| 07 | Trapping Rain Water | HARD | 70.0 | 65% | Array · Two Pointers · Dynamic Programming |
| 08 | Jump Game | MEDIUM | 70.0 | 39% | Array · Dynamic Programming · Greedy |
| 09 | Minimum Window Substring | HARD | 70.0 | 45% | Hash Table · String · Sliding Window |
| 10 | Merge Intervals | MEDIUM | 70.0 | 49% | Array · Sorting |
| 11 | Reverse Nodes in k-Group | HARD | 60.0 | 63% | Linked List · Recursion |
| 12 | Longest Valid Parentheses | HARD | 60.0 | 36% | String · Dynamic Programming · Stack |
| 13 | Word Search | MEDIUM | 60.0 | 45% | Array · String · Backtracking |
| 14 | Longest Palindromic Substring | MEDIUM | 60.0 | 36% | Two Pointers · String · Dynamic Programming |
| 15 | Longest Substring Without Repeating Characters | MEDIUM | 60.0 | 37% | Hash Table · String · Sliding Window |
| 16 | Find First and Last Position of Element in Sorted Array | MEDIUM | 60.0 | 47% | Array · Binary Search |
| 17 | Generate Parentheses | MEDIUM | 60.0 | 77% | String · Dynamic Programming · Backtracking |
| 18 | Increasing Triplet Subsequence | MEDIUM | 60.0 | 39% | Array · Greedy |
| 19 | Product of Array Except Self | MEDIUM | 60.0 | 68% | Array · Prefix Sum |
| 20 | Majority Element | EASY | 60.0 | 66% | Array · Hash Table · Divide and Conquer |
| 21 | Jump Game II | MEDIUM | 60.0 | 42% | Array · Dynamic Programming · Greedy |
| 22 | Evaluate Division | MEDIUM | 60.0 | 63% | Array · String · Depth-First Search |
| 23 | Search a 2D Matrix II | MEDIUM | 60.0 | 55% | Array · Binary Search · Divide and Conquer |
| 24 | Regular Expression Matching | HARD | 60.0 | 29% | String · Dynamic Programming · Recursion |
| 25 | Implement Trie (Prefix Tree) | MEDIUM | 60.0 | 68% | Hash Table · String · Design |
| 26 | Min Stack | MEDIUM | 60.0 | 56% | Stack · Design |
| 27 | Edit Distance | MEDIUM | 60.0 | 59% | String · Dynamic Programming |
| 28 | Sliding Window Maximum | HARD | 60.0 | 48% | Array · Queue · Sliding Window |
| 29 | Insert Delete GetRandom O(1) | MEDIUM | 60.0 | 55% | Array · Hash Table · Math |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual MakeMyTrip OA. The proctor cannot see it. Screen share cannot detect it. Made for the engineer who has done the work but might still blank with a webcam pointed at him.
Get StealthCoder- array17 · 59%
- dynamic programming11 · 38%
- string11 · 38%
- hash table9 · 31%
- depth first search4 · 14%
- sliding window4 · 14%
- breadth first search3 · 10%
- graph3 · 10%
- stack3 · 10%
- greedy3 · 10%
Array problems dominate MakeMyTrip's assessments, appearing in 17 of 29 questions. Dynamic programming and string manipulation both show up in 11 problems each, often combined (see Longest Ideal Subsequence, Longest Palindromic Substring, Longest Substring Without Repeating Characters). Hash-table thinking is embedded in 9 problems, usually as a second pattern for optimization. Hard problems lean heavily on array-DP fusion (Sum Of Special Evenly-Spaced Elements, Trapping Rain Water, Minimum Window Substring), so if you see a HARD problem with an array tag, assume you'll need to optimize past a naive nested-loop approach. Sliding-window appears in 4 problems and is the pattern that breaks candidates who don't practice it explicitly. Study two-pointer and sliding-window approaches on strings and arrays first, then drill DP state definition on medium problems. By the time you sit for the assessment, you should be able to spot a sliding-window setup and code it clean without hesitation. StealthCoder is your hedge for the one DP variant you didn't see coming.
Companies with similar patterns
If you prepped for MakeMyTrip, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass MakeMyTrip.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Made for the engineer who has done the work but might still blank with a webcam pointed at him. Works on HackerRank, CodeSignal, CoderPad, and Karat.
MakeMyTrip interview FAQ
What should I drill first for MakeMyTrip?+
Array manipulation and sliding-window patterns. They appear in 17 and 4 problems respectively. Master two-pointer techniques on arrays (Merge Intervals, Trapping Rain Water) and sliding-window on strings (Minimum Window Substring, Longest Substring Without Repeating Characters) before touching DP. You'll see these patterns in your first 10 minutes of the assessment.
How many dynamic-programming problems should I expect?+
11 out of 29 reported problems involve DP, though not all are pure DP. Many are hybrid: array plus DP (Sum Of Special Evenly-Spaced Elements), string plus DP (Longest Ideal Subsequence), or greedy plus DP (Jump Game). Focus on recurrence definition and base cases. Drill 5 to 7 medium DP problems before your assessment.
Is two-pointer enough for string problems here?+
No. MakeMyTrip's string problems mix two-pointer, sliding-window, and DP. Longest Substring Without Repeating Characters and Minimum Window Substring are both sliding-window plus hash-table, not pure two-pointer. Longest Palindromic Substring and Longest Valid Parentheses require DP or stack thinking. Study all three approaches.
How hard are the problems I'll actually face?+
Mostly medium. 20 of 29 problems are MEDIUM difficulty. Hard problems (Trapping Rain Water, Minimum Window Substring, First Missing Positive) exist but are less frequent. If you can execute clean code on medium-level arrays, strings, and hash-tables under time pressure, you'll pass the majority of the assessment.
Should I study graph or heap problems?+
Lower priority. Graph appears in 3 problems (Reachable Nodes, Cheapest Flights) and heap in 2. Only study Cheapest Flights (medium, DP plus Dijkstra) if you finish your array, string, and hash-table drills early. Focus on the 17 array problems first and you'll cover 58 percent of the assessment.