Skip to content

InMobi interview questions

The most frequent LeetCode problems tagged to InMobi. This is a data-only page. For process and behavioral prep, use the coding guide and behavioral guide.

Based on 3 distinct problems tagged to InMobi in the last 6 months (3 in the last 30 days, 3 in the last 3 months, 13 all-time) across two open datasets of LeetCode company tags. Tags are user-reported, so treat frequency as a signal, not a promise.

Difficulty mix (last 6 months): Hard 100%

Most tagged topics (share of problems): Array 67%, Dynamic Programming 33%, Matrix 33%, Depth-First Search 33%, Graph Theory 33%, Biconnected Component 33%, Bridge (Graph) 33%, Hash Table 33%, Greedy 33%, Queue 33%

Watch out: InMobi has thin LeetCode data. Weight the reported questions and the format notes above more than this list.

Most frequent problems

Ranked by frequency, weighted toward the last 30 days. Classics like Two Sum sit near the top of almost every company's list because users tag them everywhere. Solve those fast. The signature list below is more specific to this company.

# Problem Difficulty Last seen Topics
1 Cherry Pickup Hard 30 days Array, Dynamic Programming, Matrix
2 Critical Connections in a Network Hard 30 days Depth-First Search, Graph Theory, Biconnected Component, Bridge (Graph)
3 Lexicographically Maximum MEX Array Hard 30 days Array, Hash Table, Greedy, Queue

Signature problems

Problems where InMobi accounts for a large share of all recent tags across companies. These are the most InMobi-specific questions in the data.

# Problem Difficulty Last seen Topics
1 Cherry Pickup Hard 30 days Array, Dynamic Programming, Matrix
2 Critical Connections in a Network Hard 30 days Depth-First Search, Graph Theory, Biconnected Component, Bridge (Graph)

Sources

Next: More companies