MakeMyTrip LeetCode Questions
29 questions all-time · 1 easy · 20 medium · 8 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Reachable Nodes With Restrictions Array, Hash Table, Tree, Depth-First Search, Breadth-First Search, Union Find, Graph | Medium | 100 | 59.5% |
| 2 | Length of Longest Subarray With at Most K Frequency Array, Hash Table, Sliding Window | Medium | 100 | 55.8% |
| 3 | Sum Of Special Evenly-Spaced Elements In Array Array, Dynamic Programming | Hard | 100 | 49.2% |
| 4 | Longest Ideal Subsequence Hash Table, String, Dynamic Programming | Medium | 100 | 46.8% |
| 5 | First Missing Positive Array, Hash Table | Hard | 94 | 41.1% |
| 6 | Cheapest Flights Within K Stops Dynamic Programming, Depth-First Search, Breadth-First Search, Graph, Heap (Priority Queue), Shortest Path | Medium | 83 | 40.4% |
| 7 | Merge Intervals Array, Sorting | Medium | 70 | 49.4% |
| 8 | Trapping Rain Water Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack | Hard | 70 | 65.1% |
| 9 | Jump Game Array, Dynamic Programming, Greedy | Medium | 70 | 39.5% |
| 10 | Minimum Window Substring Hash Table, String, Sliding Window | Hard | 70 | 45.4% |
| 11 | Generate Parentheses String, Dynamic Programming, Backtracking | Medium | 60 | 77.1% |
| 12 | Search a 2D Matrix II Array, Binary Search, Divide and Conquer, Matrix | Medium | 60 | 55.2% |
| 13 | Longest Palindromic Substring Two Pointers, String, Dynamic Programming | Medium | 60 | 35.8% |
| 14 | Word Search Array, String, Backtracking, Depth-First Search, Matrix | Medium | 60 | 45.3% |
| 15 | Regular Expression Matching String, Dynamic Programming, Recursion | Hard | 60 | 29.3% |
| 16 | Implement Trie (Prefix Tree) Hash Table, String, Design, Trie | Medium | 60 | 67.9% |
| 17 | Min Stack Stack, Design | Medium | 60 | 56.4% |
| 18 | Edit Distance String, Dynamic Programming | Medium | 60 | 58.8% |
| 19 | Sliding Window Maximum Array, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue | Hard | 60 | 47.6% |
| 20 | Product of Array Except Self Array, Prefix Sum | Medium | 60 | 67.8% |
| 21 | Evaluate Division Array, String, Depth-First Search, Breadth-First Search, Union Find, Graph, Shortest Path | Medium | 60 | 63.1% |
| 22 | Longest Valid Parentheses String, Dynamic Programming, Stack | Hard | 60 | 36.3% |
| 23 | Longest Substring Without Repeating Characters Hash Table, String, Sliding Window | Medium | 60 | 36.9% |
| 24 | Reverse Nodes in k-Group Linked List, Recursion | Hard | 60 | 63.0% |
| 25 | Increasing Triplet Subsequence Array, Greedy | Medium | 60 | 39.1% |
| 26 | Majority Element Array, Hash Table, Divide and Conquer, Sorting, Counting | Easy | 60 | 65.7% |
| 27 | Jump Game II Array, Dynamic Programming, Greedy | Medium | 60 | 41.5% |
| 28 | Find First and Last Position of Element in Sorted Array Array, Binary Search | Medium | 60 | 46.8% |
| 29 | Insert Delete GetRandom O(1) Array, Hash Table, Math, Design, Randomized | Medium | 60 | 55.0% |
How to read this list
The tabs at the top split the questions by how recently people said they were asked in interviews. "Last 30 Days" is the past month, "Last 3 Months" is the past quarter, and so on. "All Time" is every question on record for this company.
Frequency is a score from 0 to 100 for how often a question showed up in that time window. A higher number means it came up more often, so the list starts with the most common questions first. Acceptance is the share of submissions that pass on LeetCode. Click any question to open it on LeetCode.