Cheapest Flights Within K Stops
Company: InMobi_3rdaug
Difficulty: medium
Dynamic Programming
Breadth-First Search
Graph Theory
Heap (Priority Queue)
Shortest Path
More InMobi_3rdaug OA questions
Interview experiences