Trip Planner

Company: MakeMyTrip

Difficulty: medium

Dynamic Programming Graph Shortest Path Breadth-First Search Heap (Priority Queue)

More MakeMyTrip OA questions Interview experiences