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