DSA Doctor
Verified Company Vault
Makemytrip DSA Interview Questions
23 curated coding interview questions directly asked in Makemytrip technical rounds, sorted by frequency with recency and difficulty diagnostics.
23
Total Questions
0 (0%)
Easy Problems
16 (70%)
Medium Problems
7 (30%)
Hard Problems
🔥 Most Tested Topics:
Strings (9)Arrays (8)Trees (4)Core DSA (3)Dynamic Programming (2)
📂 Sourced Datasets:
All questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 2958 | Length of Longest Subarray With at Most K Frequency | Medium | Arrays | Sorting / Prefix / Scan | 56.6% | 100.0% | all |
| 1714 | Sum Of Special Evenly-Spaced Elements In Array | Hard | Arrays | Sorting / Prefix / Scan | 49.9% | 100.0% | all |
| 2370 | Longest Ideal Subsequence | Medium | Core DSA | Implementation / Reasoning | 46.6% | 100.0% | all |
| 2368 | Reachable Nodes With Restrictions | Medium | Trees | DFS / BFS | 60.4% | 100.0% | all |
| 41 | First Missing Positive | Hard | Arrays | Sorting / Prefix / Scan | 42.9% | 87.5% | all |
| 787 | Cheapest Flights Within K Stops | Medium | Heap | Priority Queue | 41.8% | 87.5% | all |
| 56 | Merge Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.8% | 75.0% | all |
| 49 | Group Anagrams | Medium | Strings | Hashing / Sliding Window | 72.6% | 75.0% | all |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 75.0% | all |
| 22 | Generate Parentheses | Medium | Strings | Hashing / Sliding Window | 78.7% | 62.5% | all |
| 42 | Trapping Rain Water | Hard | Core DSA | Two Pointers | 67.4% | 62.5% | all |
| 76 | Minimum Window Substring | Hard | Arrays; Strings; Trees | Sorting / Prefix / Scan; Hashing / Sliding Window; DFS / BFS; Sliding Window | 47.5% | 62.5% | all |
| 32 | Longest Valid Parentheses | Hard | Strings | Hashing / Sliding Window | 38.8% | 62.5% | all |
| 399 | Evaluate Division | Medium | Core DSA | Implementation / Reasoning | 64.2% | 62.5% | all |
| 239 | Sliding Window Maximum | Hard | Arrays | Sorting / Prefix / Scan; Sliding Window | 48.8% | 62.5% | all |
| 5 | Longest Palindromic Substring | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 37.8% | 62.5% | all |
| 79 | Word Search | Medium | Strings; Binary Search | Hashing / Sliding Window; Binary Search | 47.4% | 62.5% | all |
| 43 | Multiply Strings | Medium | Strings | Hashing / Sliding Window | 44.2% | 62.5% | all |
| 918 | Maximum Sum Circular Subarray | Medium | Arrays | Sorting / Prefix / Scan | 50.2% | 62.5% | all |
| 127 | Word Ladder | Hard | Strings | Hashing / Sliding Window | 45.6% | 62.5% | all |
| 198 | House Robber | Medium | Dynamic Programming | State Transition | 53.2% | 62.5% | all |
| 75 | Sort Colors | Medium | Arrays | Sorting / Prefix / Scan | 69.6% | 62.5% | all |
| 213 | House Robber II | Medium | Dynamic Programming | State Transition | 44.9% | 62.5% | all |