Question 1

Reachable Nodes With Restrictions — MakeMyTrip Interview Question

Accepted Answer

"Reachable Nodes With Restrictions" is a medium difficulty problem asked at MakeMyTrip interviews. It covers the following topics: Array, Hash Table, Tree, Depth-First Search, Breadth-First Search, Union Find, Graph. You can practice it on LeetCode: https://leetcode.com/problems/reachable-nodes-with-restrictions

Question 2

Length of Longest Subarray With at Most K Frequency — MakeMyTrip Interview Question

Accepted Answer

"Length of Longest Subarray With at Most K Frequency" is a medium difficulty problem asked at MakeMyTrip interviews. It covers the following topics: Array, Hash Table, Sliding Window. You can practice it on LeetCode: https://leetcode.com/problems/length-of-longest-subarray-with-at-most-k-frequency

Question 3

Sum Of Special Evenly-Spaced Elements In Array — MakeMyTrip Interview Question

Accepted Answer

"Sum Of Special Evenly-Spaced Elements In Array" is a hard difficulty problem asked at MakeMyTrip interviews. It covers the following topics: Array, Dynamic Programming. You can practice it on LeetCode: https://leetcode.com/problems/sum-of-special-evenly-spaced-elements-in-array

Question 4

Longest Ideal Subsequence — MakeMyTrip Interview Question

Accepted Answer

"Longest Ideal Subsequence" is a medium difficulty problem asked at MakeMyTrip interviews. It covers the following topics: Hash Table, String, Dynamic Programming. You can practice it on LeetCode: https://leetcode.com/problems/longest-ideal-subsequence

Question 5

First Missing Positive — MakeMyTrip Interview Question

Accepted Answer

"First Missing Positive" is a hard difficulty problem asked at MakeMyTrip interviews. It covers the following topics: Array, Hash Table. You can practice it on LeetCode: https://leetcode.com/problems/first-missing-positive

Question 6

Cheapest Flights Within K Stops — MakeMyTrip Interview Question

Accepted Answer

"Cheapest Flights Within K Stops" is a medium difficulty problem asked at MakeMyTrip interviews. It covers the following topics: Dynamic Programming, Depth-First Search, Breadth-First Search, Graph, Heap (Priority Queue), Shortest Path. You can practice it on LeetCode: https://leetcode.com/problems/cheapest-flights-within-k-stops

#	Question Title	Difficulty	Frequency	Topics
1	Reachable Nodes With Restrictions	MEDIUM	100.0	ArrayHash TableTree+4
2	Length of Longest Subarray With at Most K Frequency	MEDIUM	100.0	ArrayHash TableSliding Window
3	Sum Of Special Evenly-Spaced Elements In Array	HARD	100.0	ArrayDynamic Programming
4	Longest Ideal Subsequence	MEDIUM	100.0	Hash TableStringDynamic Programming
5	First Missing Positive	HARD	94.4	ArrayHash Table
6	Cheapest Flights Within K Stops	MEDIUM	82.7	Dynamic ProgrammingDepth-First SearchBreadth-First Search+3
7	Merge Intervals	MEDIUM	70.0	ArraySorting
8	Trapping Rain Water	HARD	70.0	ArrayTwo PointersDynamic Programming+2
9	Jump Game	MEDIUM	70.0	ArrayDynamic ProgrammingGreedy
10	Minimum Window Substring	HARD	70.0	Hash TableStringSliding Window

Explore 450+ Companies

Companies

MakeMyTrip

Want to see more?

MakeMyTrip Interview Questions

Ai Assistant Kas

Explore 450+ Companies

Companies

AA CompaniesBrowse companies

BB CompaniesBrowse companies

CC CompaniesBrowse companies

DD CompaniesBrowse companies

EE CompaniesBrowse companies

FF CompaniesBrowse companies

GG CompaniesBrowse companies

HH CompaniesBrowse companies

II CompaniesBrowse companies

JJ CompaniesBrowse companies

KK CompaniesBrowse companies

LL CompaniesBrowse companies

MM CompaniesBrowse companies

NN CompaniesBrowse companies

OO CompaniesBrowse companies

PP CompaniesBrowse companies

QQ CompaniesBrowse companies

RR CompaniesBrowse companies

SS CompaniesBrowse companies

TT CompaniesBrowse companies

UU CompaniesBrowse companies

VV CompaniesBrowse companies

WW CompaniesBrowse companies

XX CompaniesBrowse companies

YY CompaniesBrowse companies

ZZ CompaniesBrowse companies

MakeMyTrip

Want to see more?

MakeMyTrip Interview Questions

Ai Assistant Kas