Company: MakeMyTrip
Difficulty: medium
Graph Theory
Shortest Path
Dynamic Programming
Breadth-First Search
Heap (Priority Queue)
More MakeMyTrip OA questions
Interview experiences