Indian Unicorn
InMobi runs an algorithm-first loop weighted toward arrays, dynamic programming and graph traversal, with follow-ups on how your solution behaves at ad-serving scale.
13 real interview questions actually asked at InMobi — filter by how recently they were reported.
0%
0/3
Overall progress
0 / 3
0/0
Easy
0/0
Medium
0/3
Hard
Asked in
InMobi runs an algorithm-first loop weighted toward arrays, dynamic programming and graph traversal, with follow-ups on how your solution behaves at ad-serving scale.
Across the 13 questions on this page, the weight sits on these patterns:
This sheet collects 13 InMobi interview questions, grouped into 5 patterns. They are questions reported as actually asked in InMobi interviews, and each one carries how recently it was reported so you can practise the current set first.
Array, Dynamic Programming, String come first — the patterns on this page are ordered by how often InMobi leans on them, so working top-down spends your time where the interview actually is. The full order is Array, Dynamic Programming, String, Binary Search, Depth-First Search, Breadth-First Search, Graph Theory.
At roughly 25 minutes per problem — reading it, solving it and writing the approach down — 13 problems is about 5 hours, or 1 weeks at ten hours a week. Most people do not need all of it: the first two or three patterns cover the majority of what gets asked.
Yes. Every problem, the pattern grouping and the progress tracking are free and need no account. Progress saves in your browser, and signing in with Google only adds syncing across devices.
Yes — tick a problem on this page and it stays ticked. The counts per pattern update as you go, so you can see which of InMobi's topics you have actually covered rather than guessing.