InMobi coding interview
questions, leaked.
6 problems reported across recent InMobi interviews. Top patterns: binary search, two pointers, string. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
InMobi's assessment is split down the middle: three medium and three hard problems with zero easy warm-ups. You're looking at binary search, two-pointers, strings, and dynamic programming as the core patterns, each appearing twice. Problems like Trapping Rain Water and Longest Valid Parentheses are classic hard problems that require both pattern recognition and clean implementation. Most candidates don't have time to drill all variants before the OA. If you hit a wall on the DP or stack problem mid-assessment, StealthCoder surfaces a working solution invisible to the proctor in seconds. That safety net matters when the clock's ticking.
Top problems at InMobi
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Reach a Number | MEDIUM | 100.0 | 44% | Math · Binary Search |
| 02 | Partition Labels | MEDIUM | 65.2 | 82% | Hash Table · Two Pointers · String |
| 03 | Maximum Number of Robots Within Budget | HARD | 65.2 | 37% | Array · Binary Search · Queue |
| 04 | Redundant Connection | MEDIUM | 65.2 | 66% | Depth-First Search · Breadth-First Search · Union Find |
| 05 | Longest Valid Parentheses | HARD | 65.2 | 36% | String · Dynamic Programming · Stack |
| 06 | Trapping Rain Water | HARD | 65.2 | 65% | Array · Two Pointers · Dynamic Programming |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual InMobi OA. The proctor cannot see it. Screen share cannot detect it. Made by a working Amazon engineer who got tired of watching qualified friends bomb OAs they'd solve cold in an IDE.
Get StealthCoder- binary search2 · 33%
- two pointers2 · 33%
- string2 · 33%
- array2 · 33%
- dynamic programming2 · 33%
- stack2 · 33%
- math1 · 17%
- hash table1 · 17%
- greedy1 · 17%
- queue1 · 17%
The problem set clusters around two camps: search and optimization (binary search, two-pointers, sliding window) and state problems (dynamic programming, stack, hash table). Binary search and two-pointers each show up twice, so you need both patterns locked in. DP and stack are also frequent, meaning if you're weak on either, you're exposed on two problems. Reach a Number and Partition Labels are medium-difficulty gatekeepers; if you clear those, the hard trio (Trapping Rain Water, Longest Valid Parentheses, Maximum Number of Robots Within Budget) is where most candidates slow down or blank. The robot budget problem pulls from six different topics at once, which signals an intentionally complex constraint-optimization ask. When you're deep in the OA and you've already spent eight minutes on monotonic queues, StealthCoder is your insurance policy against running out of time on the last problem.
Companies with similar patterns
If you prepped for InMobi, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass InMobi.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Made by a working Amazon engineer who got tired of watching qualified friends bomb OAs they'd solve cold in an IDE. Works on HackerRank, CodeSignal, CoderPad, and Karat.
InMobi interview FAQ
How much should I drill two-pointers and binary search before the InMobi OA?+
Both appear twice in the problem set, so they're load-bearing. Spend at least 4 to 5 hours on each. Partition Labels (two-pointers, hash table, greedy combined) and Reach a Number (math, binary search) are the test's medium-level versions. Get comfortable with both patterns before the OA.
Is dynamic programming essential for this assessment?+
Yes. DP appears twice: once in Longest Valid Parentheses (string DP with stack backup) and in Trapping Rain Water. Both are hard. If DP isn't solid, you'll stall on both. Expect to spend time on state-transition logic under pressure.
What's the hardest problem InMobi asks?+
Maximum Number of Robots Within Budget combines seven topics: binary search, sliding window, heap, monotonic queue, prefix sum, and constraints all at once. It's the hardest constraint-optimization problem in the set. Most candidates need 20+ minutes to solve it cleanly.
Should I study graph problems for InMobi?+
One problem (Redundant Connection) uses Union Find and graph concepts, but it appears only once in the reported set. Don't skip it, but prioritize two-pointers, binary search, and DP first. Graph knowledge is a nice-to-have, not must-have.
How many problems should I solve before the OA?+
You have only six problems in the reported set, so depth over breadth. Solve Partition Labels and Reach a Number until they're automatic. Then spend serious time on Trapping Rain Water and Longest Valid Parentheses. One or two reps of each core problem beats 20 random problems.