InMobi interview practice
InMobi Interview Questions: Graphs and Coding Practice Start with verified evidence.
Practice from 45 InMobi-tagged public coding problems, organized only by the stage, topic, difficulty, and recency metadata FastPrep can verify.
- Catalog
- 45 public practice assets (45 coding)
- Start here
- Use the stage named in your invitation
- Evidence
- OA · Phone · Onsite metadata, shown in context
OA practice path
Online Assessment
Build a timed implementation rhythm from prompt to edge cases. Problems are ranked by repeated public catalog sightings.
17 InMobi-tagged Online Assessment problems available.
| Company | Problem | Difficulty | Public evidence | Action |
|---|---|---|---|---|
INInMobi | Connected Components with Divisor ThresholdGraphMath | Medium | 2 public reportsLast reported Aug 2026 | Practice |
INInMobi | Maximize Impression ValueArrayDynamic Programming | Medium | 1 public reportLast reported Aug 2026 | Practice |
INInMobi | Supply Path OptimizationGraphDepth-First Search | Medium | 1 public reportLast reported Aug 2026 | Practice |
INInMobi | Delivery ServiceGraphDepth-First Search | Hard | 1 public reportLast reported Jun 2026 | Practice |
INInMobi | Shared InterestGraphUnion Find | Medium | 1 public reportLast reported Jun 2026 | Practice |
INInMobi | Temporal AnomaliesArraySorting | Hard | 1 public reportLast reported Jun 2026 | Practice |
INInMobi | Cheapest Flights Within K StopsGraphDynamic Programming | Medium | 1 public reportLast reported Dec 2021 | Practice |
INInMobi | Connect N Ropes With Minimum CostHeapGreedy | Medium | 1 public reportLast reported Dec 2021 | Practice |
INInMobi | Employee SubordinatesTreeDepth-First Search | Easy | 1 public reportLast reported Dec 2021 | Practice |
INInMobi | Check Bipartite GraphGraphMatrix | Medium | 1 public reportLast reported Aug 2021 | Practice |
INInMobi | Count Subarrays With Given XORArrayHash Table | Medium | 1 public reportLast reported Aug 2021 | Practice |
INInMobi | Course ScheduleGraphBreadth-First Search | Medium | 1 public reportLast reported Aug 2021 | Practice |
INInMobi | Count Subarrays With Sum Divisible by KArrayHash Table | Medium | 1 public reportLast reported Jul 2020 | Practice |
INInMobi | Generate Balanced ParenthesesStringBacktracking | Medium | 1 public reportLast reported Jul 2020 | Practice |
INInMobi | Minimum Connection ChangesGraphUnion Find | Medium | 1 public reportLast reported Jul 2020 | Practice |
INInMobi | Choose One from Each Set to Minimize the RangeArraySorting | Hard | 1 public reportLast reported Apr 2015 | Practice |
INInMobi | Classify a Number Series and Return the Next TermArrayMath | Easy | 1 public reportLast reported Aug 2014 | Practice |
Phone practice path
Phone Screen
Practice solving while explaining assumptions, tradeoffs, and complexity. Problems are ranked by repeated public catalog sightings.
| Company | Problem | Difficulty | Public evidence | Action |
|---|---|---|---|---|
INInMobi | House Robber IArrayDynamic Programming | Medium | 1 public reportLast reported Aug 2026 | Practice |
INInMobi | Word Break IIStringDynamic Programming | Hard | 1 public reportLast reported Aug 2026 | Practice |
INInMobi | Bus Station Seat AllotmentArrayQueue | Medium | 1 public reportLast reported Mar 2026 | Practice |
INInMobi | Find Missing and Duplicate IntegerArrayMath | Medium | 1 public reportLast reported Mar 2026 | Practice |
INInMobi | Frequency Equals Card ValueArrayHash Table | Easy | 1 public reportLast reported Mar 2026 | Practice |
INInMobi | Frog Position After T SecondsTreeGraph | Medium | 1 public reportLast reported Mar 2026 | Practice |
INInMobi | IPOArraySorting | Hard | 1 public reportLast reported Mar 2026 | Practice |
INInMobi | Evaluate DivisionGraphDepth-First Search | Medium | 1 public reportLast reported Dec 2025 | Practice |
INInMobi | Compare Version NumbersStringTwo Pointers | Medium | 1 public reportLast reported Feb 2022 | Practice |
INInMobi | Count Array DerangementsDynamic ProgrammingMath | Medium | 1 public reportLast reported Feb 2022 | Practice |
INInMobi | Maximum Frequency StackHash TableStack | Hard | 1 public reportLast reported Feb 2022 | Practice |
INInMobi | Max Consecutive Ones IIIArraySliding Window | Medium | 1 public reportLast reported Jan 2022 | Practice |
INInMobi | Sudoku SolverBacktrackingMatrix | Hard | 1 public reportLast reported Jan 2022 | Practice |
INInMobi | Longest Palindromic SubstringStringDynamic Programming | Medium | 1 public reportLast reported Jul 2021 | Practice |
Onsite practice path
Onsite
Practice complete solutions and defend the choices behind them. Problems are ranked by repeated public catalog sightings.
| Company | Problem | Difficulty | Public evidence | Action |
|---|---|---|---|---|
INInMobi | Russian Doll EnvelopesArraySorting | Hard | 1 public reportLast reported Jul 2026 | Practice |
INInMobi | Minimum and Maximum with Optimal ComparisonsArray | Easy | 1 public reportLast reported Dec 2025 | Practice |
INInMobi | Minimum Edges to Connect All ComponentsGraphUnion Find | Easy | 1 public reportLast reported Dec 2025 | Practice |
INInMobi | Shortest Path Visiting All NodesGraphBreadth-First Search | Hard | 1 public reportLast reported Sep 2025 | Practice |
INInMobi | Maximum Sum of Non-Adjacent Tree NodesTreeDepth-First Search | Medium | 1 public reportLast reported Jan 2022 | Practice |
INInMobi | Word SquaresStringTrie | Hard | 1 public reportLast reported Jan 2022 | Practice |
INInMobi | Maximum Length Pair ChainArraySorting | Medium | 1 public reportLast reported Jul 2021 | Practice |
INInMobi | Top View of a Binary TreeTreeBreadth-First Search | Medium | 1 public reportLast reported Jul 2021 | Practice |
INInMobi | Maximum XOR Between Two ArraysArrayBit Manipulation | Hard | 1 public reportLast reported May 2021 | Practice |
INInMobi | Trapping Rain WaterArrayTwo Pointers | Medium | 1 public reportLast reported May 2021 | Practice |
INInMobi | Validate Binary Search TreeTreeDepth-First Search | Medium | 1 public reportLast reported May 2021 | Practice |
INInMobi | Robot Survival ProbabilityDynamic ProgrammingMatrix | Medium | 1 public reportLast reported Dec 2015 | Practice |
INInMobi | Knight Exit ProbabilityDynamic ProgrammingMath | Medium | 1 public reportLast reported Apr 2015 | Practice |
INInMobi | Minimum Row Deletions to Prevent a Target ORArrayMatrix | Hard | 1 public reportLast reported Apr 2015 | Practice |
01 · Preparation plan
Practice choosing between recurrence, connectivity, and order.
InMobi's available coding inventory spans several algorithm families rather than one narrow format. Compare a local-choice recurrence, a connected-components model, and a sorted nesting problem. This variety helps reveal when a familiar technique does not fit, without inventing an advertising-domain interview syllabus. This is a suggested practice sequence, not the employer's interview process. Your invitation and recruiter guidance remain the source of truth.
- 01
Define the smallest useful dynamic-programming state
House Robber is a compact way to practice a recurrence and its proof. Explain what information from earlier choices is still needed before compressing memory.
- Write include and exclude choices for one position.
- Test an empty input and adjacent high values.
- Explain why discarded history cannot change the optimum.
- 02
Model connectivity rather than enumerate paths
The divisor-threshold problem is useful for deciding when union-find is a better fit than repeated graph search. Connect numbers through the relationship specified by the prompt.
- Separate the threshold rule from the connectivity query.
- Avoid adding redundant pairwise edges where possible.
- Test isolated values and transitive connections.
- 03
Handle ties before finding a subsequence
Russian Doll Envelopes links sorting with an increasing-subsequence method. The tie rule is essential: an apparent increase in one coordinate must not permit an invalid nesting.
- Build a counterexample with equal widths.
- Choose the secondary sort direction deliberately.
- Explain how binary search updates the candidate tails.
02 · Evidence boundary
What “InMobi interview questions” means here.
It means practicing transferable implementation, testing, and technical reasoning with public catalog assets FastPrep tags to InMobi. It does not mean FastPrep has access to the company's assessments or any private interview bank.
Repeated public sightings and last-reported dates can help you prioritize practice, but they cannot predict the questions, format, or platform in a specific interview.
- Only InMobi-tagged FastPrep catalog problems appear above.
- Stage labels and report dates remain visible as context.
- No official, private, leaked, or proprietary questions are claimed.
03 · Plain answers
InMobi interview practice questions, answered plainly.
This page owns technical-practice intent for InMobi. Hiring activity, timelines, and market signals remain on the separate hiring-insights page.
01Does this page teach InMobi's advertising systems interview?
The current page is grounded in public coding exercises. Advertising-related names in a prompt do not establish a complete ad-tech design curriculum or InMobi's internal architecture. Use the catalog for algorithm practice and add role-specific system knowledge only when your job description or recruiter requests it.
02Is FastPrep affiliated with InMobi?
No. FastPrep is an independent interview-preparation product and is not affiliated with InMobi. The page uses FastPrep's public practice catalog and does not claim official, private, leaked, or proprietary employer questions.
03How are InMobi problems assigned to interview stages?
Stage labels come from FastPrep's public problem metadata. A problem can carry more than one reported stage, and hiring processes can change by role, level, location, and date. Treat the labels as preparation context, not a guarantee.
04Which InMobi interview stage should I practice first?
Start with the stage named in your invitation or recruiter message. If no stage is known, use the largest available set to build general problem-solving fluency, then rehearse explanation and testing separately.
05Does this page predict the InMobi interview process?
No. Public catalog counts, stage tags, and last-reported dates can help prioritize practice, but they cannot predict a specific interview's questions, sequence, timing, or platform.
Your next stage, made concrete
Pick a problem. Solve it end to end.
Start with the stage named in your invitation, then use public evidence as context—not as a promise of what you will be asked.
Open the practice set