MakeMyTrip interview questions¶
The most frequent LeetCode problems tagged to MakeMyTrip. This is a data-only page. For process and behavioral prep, use the coding guide and behavioral guide.
Based on 0 distinct problems tagged to MakeMyTrip in the last 6 months (0 in the last 30 days, 0 in the last 3 months, 20 all-time) across two open datasets of LeetCode company tags. Tags are user-reported, so treat frequency as a signal, not a promise.
Most frequent problems¶
Ranked by frequency, weighted toward the last 30 days. Classics like Two Sum sit near the top of almost every company's list because users tag them everywhere. Solve those fast. The signature list below is more specific to this company.
| # | Problem | Difficulty | Last seen | Topics |
|---|---|---|---|---|
| 1 | Length of Longest Subarray With at Most K Frequency | Medium | Older | Array, Hash Table, Sliding Window |
| 2 | Longest Ideal Subsequence | Medium | Older | Hash Table, String, Dynamic Programming |
| 3 | Reachable Nodes With Restrictions | Medium | Older | Array, Hash Table, Tree, Depth-First Search |
| 4 | Sum Of Special Evenly-Spaced Elements In Array | Hard | Older | Array, Dynamic Programming, Sqrt Decomposition |
| 5 | First Missing Positive | Hard | Older | Array, Hash Table |
| 6 | Cheapest Flights Within K Stops | Medium | Older | Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory |
| 7 | Longest Substring Without Repeating Characters | Medium | Older | Hash Table, String, Sliding Window |
| 8 | Merge Intervals | Medium | Older | Array, Sorting, Quicksort |
| 9 | Generate Parentheses | Medium | Older | String, Dynamic Programming, Backtracking, Bracket Sequences |
| 10 | Group Anagrams | Medium | Older | Array, Hash Table, String, Sorting |
| 11 | House Robber | Medium | Older | Array, Dynamic Programming |
| 12 | House Robber II | Medium | Older | Array, Dynamic Programming |
| 13 | Longest Palindromic Substring | Medium | Older | Two Pointers, String, Dynamic Programming, Manacher |
| 14 | Longest Valid Parentheses | Hard | Older | String, Dynamic Programming, Stack, Bracket Sequences |
| 15 | Maximum Sum Circular Subarray | Medium | Older | Array, Divide and Conquer, Dynamic Programming, Queue |
| 16 | Multiply Strings | Medium | Older | Math, String, Simulation |
| 17 | Trapping Rain Water | Hard | Older | Array, Two Pointers, Dynamic Programming, Stack |
| 18 | Word Ladder | Hard | Older | Hash Table, String, Breadth-First Search, Bidirectional Search |
| 19 | Word Search | Medium | Older | Array, String, Backtracking, Depth-First Search |
| 20 | Sort Colors | Medium | Older | Array, Two Pointers, Sorting, Quicksort |
Sources¶
- liquidslr/leetcode-company-wise-problems and snehasishroy/leetcode-companywise-interview-questions, merged by scripts/build_question_data.py.
Next: More companies