InMobi SDE 1 Campus Guide: Three-Question OA, a DSA and Debugging Round, Then Your Resume
Prepare for InMobi software engineer interviews with reported assessment patterns, interview questions, and preparation advice.
On this page
Last reviewed November 16, 2026.
For students interviewing for SDE 1.
Built by the Codinzhub team from InMobi questions and interview experiences that IIT students shared on Codinzhub between October 16 and 25, 2026. Each one is one student's memory, so use this as a map, not a promise.
The 30-second version. InMobi hires freshers on campus as SDE 1. The OA is 3 coding questions, often graph-heavy, and it ran at IIT (BHU) Varanasi, IIT Kharagpur, IIT Bombay and IIT Delhi. Interviews are short: round 1 is 2 DSA questions plus 1 Python debugging question (only those who solve all three move on), and round 2 grills your resume and internship, ending with a small data-structure design. One IIT BHU student got their offer email the same evening.
Other InMobi roles: SDE intern and 6-month intern · Machine learning engineer
Round-by-round breakdown
Stage 1: Online assessment
At a glance
- Length: timed; plan for 90 minutes
- Questions per round: 3 coding
- What was asked: graphs (bottleneck paths, Dijkstra with limits, MST, cycles), sliding windows, interval counting, DP on strings
- Most common: graph problems on every campus
IIT (BHU) Varanasi, October 16
| # | Question (our summary) | How to approach it | Practice |
|---|---|---|---|
| 1 | A circular array of nodes, each covering a range; fewest nodes to switch on so every position is covered | Turn ranges into intervals on a doubled array; greedy interval cover | Minimum Nodes to Activate |
| 2 | Largest sum of a "trionic" subarray: strictly up, then strictly down, then strictly up | DP over the three phases | Trionic Array II |
| 3 | Count subarrays with exactly k odd numbers | Prefix counts of odds with a hash map (or at most k minus at most k − 1) | Exactly K Odd Numbers |
IIT Kharagpur, October 23
| Question (our summary) | How to approach it | Practice |
|---|---|---|
| Each task ID appears twice in a list; remove the fewest so the list is a valid nested sequence | Stack, like matching brackets | Repair the Track Stack |
| Send ad campaign data from server S to D through a network under limits | Graph shortest or widest path | Advertiser Ad Campaign |
| Cheapest flight within K stops | Bellman-Ford for K + 1 rounds, or BFS by stops | Cheapest Flights Within K Stops |
| Connect all servers at minimum cost | Minimum spanning tree | Minimum Networking |
| Intervals given as pairs of equal IDs; count common or overlapping ones | Positions of each ID, then sweep | Common Intervals |
IIT Bombay, October 23
| Question (our summary) | How to approach it | Practice |
|---|---|---|
| Huts on a tree of trails; choose subsidised trail permits to minimise cost | Tree DP or DFS with path counts | Subsidised Trail Permits |
| Widest crate that can travel between depots using at most k belt transfers | Bottleneck path with a hop limit: DP over (node, hops) | Widest Crate Within K Transfers |
| Fewest badges on a line of workstations so adjacent workloads satisfy a rule | Greedy left to right | Minimum Badges on the Packing Line |
IIT Delhi, October 25
| Question (our summary) | How to approach it | Practice |
|---|---|---|
| Word ladder where changing each letter position has its own cost | Dijkstra over words | Word Ladder with Per-Index Cost |
| Count ways to pick at least k non-overlapping subsequence copies of a pattern in a log | DP on positions and copies | Non-Overlapping Pattern Occurrences |
| Order company audits by dependencies; report a cycle if there is one | Topological sort with cycle detection | Company Audit Order |
More questions: Browse InMobi questions.
Stage 2: Round 1, DSA and debugging
At a glance
- Length: about an hour
- Questions per round: 2 DSA and 1 Python debugging (IIT BHU); introduction, internship and 2 DSA (IIT Gandhinagar)
- What was asked: sliding windows, stock trading, BFS, a profit problem
- Most common: standard, well-known DSA problems
What students were asked:
- IIT BHU: longest subarray with k distinct elements (sliding window); buy and sell stock II; a Python debugging task with a wrongly declared 2D list and indentation errors. Only students who solved all three got round 2. Read the experience
- IIT Gandhinagar: 15 minutes on the internship project, then a profit maximisation problem with k and workers, then rotting oranges (minimum time for all fresh cells to rot). Read the experience
Stage 3: Round 2, resume grilling
At a glance
- Length: about an hour
- Questions per round: everything on your resume, then one design task
- What was asked: high-level design, DevOps, agentic AI, LangChain, Redis (because they were on the resume)
- Most common: "you wrote this on your resume; explain it"
What to expect. The IIT BHU student was questioned on every technology on their resume. At the end came a small design-and-code task: a FIFO structure that can also delete any value from the middle faster than O(n²). They used a balanced binary search tree (an ordered map with insertion order works too). They were selected the same evening.
More from Codinzhub: every college and every year
These are the other 86 questions and experiences for this role on Codinzhub, from all colleges and drives, newest first.
| Question or experience | College or drive | Type | Posted |
|---|---|---|---|
| SDE 1 | Not stated | Interview experience | 2026-11-05 |
| Inmobi Interview Experience SDE 1 On Campus 2026 2027 | Not stated | Interview experience | 2026-11-03 |
| Inmobi SDE 1 Interview Experience | Not stated | Interview experience | 2026-10-23 |
| Minimum Removals to Make a Valid Stack Sequence | IIT Bombay | OA question | 2026-10-10 |
| Minimum Number of Police Officers to Cover All Checkpoints | IIT Bombay | OA question | 2026-10-10 |
| Maximum Number of Concurrent Operations Under a Budget | IIT Bombay | OA question | 2026-10-10 |
| Probability of Reaching a Target Node in a Tree | IIT Hyderabad | OA question | 2026-10-09 |
| Probability of Reaching a Target Node in a Tree | IIT Hyderabad | OA question | 2026-10-09 |
| Minimum Operations to Zero All Node Offsets | IIT Hyderabad | OA question | 2026-10-09 |
| Minimum Operations to Zero All Node Offsets | IIT Hyderabad | OA question | 2026-10-09 |
| Minimum Operations to Make All Tree Node Values Zero | IIT Hyderabad | OA question | 2026-10-09 |
| Maximum Number of Tiles That Can Fall | IIT Hyderabad | OA question | 2026-10-09 |
| Maximum Number of Tiles That Can Fall | IIT Hyderabad | OA question | 2026-10-09 |
| Frog Position After T Seconds | IIT Hyderabad | OA question | 2026-10-09 |
| Domino Toppling | IIT Hyderabad | OA question | 2026-10-09 |
| sum of subarray maximum | IIT Roorkee | OA question | 2026-10-07 |
| subarray maximums | IIT Roorkee | OA question | 2026-10-07 |
| Trionic Array 2 | IIT (BHU) Varanasi | OA question | 2026-10-07 |
| Sum of Max of all sub arrays | IIT Roorkee | OA question | 2026-10-07 |
| Max CTR | IIT Roorkee | OA question | 2026-10-07 |
| GPU Priority Scheduling | IIT Roorkee | OA question | 2026-10-07 |
| Count subarrays with K odd numbers | IIT (BHU) Varanasi | OA question | 2026-10-07 |
| GPU Cluster Job Scheduler | IIT Roorkee | OA question | 2026-10-06 |
| minimum towers to turn on to cover all | IIT (BHU) Varanasi | OA question | 2026-10-05 |
| count subarrays with at most k odd numbers | IIT (BHU) Varanasi | OA question | 2026-10-05 |
| count nice array | IIT (BHU) Varanasi | OA question | 2026-10-05 |
| Trionic array 2 | IIT (BHU) Varanasi | OA question | 2026-10-05 |
| Trionic Array-2 Leetcode | IIT (BHU) Varanasi | OA question | 2026-10-05 |
| Trionic Array II | IIT (BHU) Varanasi | OA question | 2026-10-05 |
| Sum of Subarray Maximums (IIT BHU OA) | IIT BHU OA) Inmobi | OA question | 2026-10-05 |
| Sub array maximum | IIT Roorkee | OA question | 2026-10-05 |
| Something like neutralize circular towers | IIT (BHU) Varanasi | OA question | 2026-10-05 |
| Number of Subarrays with Exactly K Odd Numbers | IIT (BHU) Varanasi | OA question | 2026-10-05 |
| Minimum Towers | IIT (BHU) Varanasi | OA question | 2026-10-05 |
| Minimum Elements to Cover a Circular Array | IIT (BHU) Varanasi | OA question | 2026-10-05 |
| Maximum Sum of an Up-Down-Up Subarray | IIT (BHU) Varanasi | OA question | 2026-10-05 |
| Maximum Sum of an Up-Down-Up Subarray | IIT (BHU) Varanasi | OA question | 2026-10-05 |
| GPU process scheduling | IIT Roorkee | OA question | 2026-10-05 |
| GPU Memory Reservation Planner | IIT Roorkee | OA question | 2026-10-05 |
| GPU Cluster Job Scheduler | IIT Roorkee | OA question | 2026-10-05 |
| Count nice subarryas | IIT (BHU) Varanasi | OA question | 2026-10-05 |
| Count Number of Nice subarrays | IIT (BHU) Varanasi | OA question | 2026-10-05 |
| Count Number of Nice Subarrays | IIT (BHU) Varanasi | OA question | 2026-10-05 |
| Count Number of Nice Subarrays | IIT (BHU) Varanasi | OA question | 2026-10-05 |
| Compaign wave analyzer | IIT (BHU) Varanasi | OA question | 2026-10-05 |
| Circular defence | IIT (BHU) Varanasi | OA question | 2026-10-05 |
| Circular Defense | IIT (BHU) Varanasi | OA question | 2026-10-05 |
| Campaign performance | IIT Roorkee | OA question | 2026-10-05 |
| Campaign Wave Analyzer | IIT (BHU) Varanasi | OA question | 2026-10-05 |
| Campaign CTR Leaderboard | IIT Roorkee | OA question | 2026-10-05 |
| 3640. Trionic Array II | IIT (BHU) Varanasi | OA question | 2026-10-05 |
| Idle GPU Priority Scheduling on a Shared GPU Cluster | IIT Roorkee | OA question | 2026-10-04 |
| InMobi Interview Experience for SDE-I (on-campus) | IIT R | Interview experience | 2026-09-29 |
| Swapped Neighbour Scans | IIT Kanpur 24th September | OA question | 2026-09-27 |
| Snapshot Upload 2026-09-27 17:38:03 | Not stated | OA question | 2026-09-27 |
| Snapshot Upload 2026-09-27 17:37:35 | Not stated | OA question | 2026-09-27 |
| Snapshot Upload 2026-09-27 17:37:13 | Not stated | OA question | 2026-09-27 |
| Snapshot Upload 2026-09-27 17:35:57 | Not stated | OA question | 2026-09-27 |
| Peak Profit Window | IIT Kanpur 24th September | OA question | 2026-09-27 |
| Cold Start | IIT Kanpur 24th September | OA question | 2026-09-27 |
| Inmobi Online Assessment | IIT Roorkee | OA question | 2026-09-26 |
Implement DiscountEngine with Rule Matching | IIT Roorkee | OA question | 2026-09-26 |
| DiscountTracker System Design | IIT Roorkee | OA question | 2026-09-26 |
| Best Sum Any Tree Path | IIT Roorkee | OA question | 2026-09-26 |
| Median Of Three Sorted Arrays | IIT Gandhinagar | OA question | 2026-09-25 |
| Matrix kth smallest value | IIT Gandhinagar | OA question | 2026-09-25 |
| Inmobi Online Assessment | IIT Kanpur | OA question | 2026-09-25 |
| Inmobi Online Assessment | IIT Kanpur | OA question | 2026-09-25 |
| Inmobi Online Assessment | IIT Kanpur | OA question | 2026-09-25 |
| Exit Entry Mandate | IIT Kanpur Q | OA question | 2026-09-25 |
| Longest Valid Parentheses Substring | MNNIT | OA question | 2026-09-20 |
| Inmbi Online Assessment | MNNIT | OA question | 2026-09-20 |
| InMobi SDE 1 Interview Experience Full Interview Experience Upto Hr Round | IIT (BHU) Varanasi | Interview experience | 2026-09-20 |
| Alternating Level Sum in a Binary Tree | MNNIT | OA question | 2026-09-20 |
| Q3 | Not stated | OA question | 2026-09-05 |
| Q2 | Not stated | OA question | 2026-09-05 |
| Q1 | Not stated | OA question | 2026-09-05 |
| Maximize Impression Value | IIT BHU | OA question | 2026-08-05 |
| InMobi Supply Path Optimization Problem | IIT BHU | OA question | 2026-08-05 |
| Inmobi SDE Interview Experience | Not stated | Interview experience | 2026-04-13 |
| X of a Kind in a Deck of Cards | Not stated | OA question | 2026-03-19 |
| IPO | Not stated | OA question | 2026-03-19 |
| Find the Probability to Reach the Target Node | Not stated | OA question | 2026-03-19 |
| Find Missing and Duplicate Integer | Not stated | OA question | 2026-03-19 |
| Bus Station Seat Allotment | Not stated | OA question | 2026-03-19 |
| projects from cses sheet | Indian Institute of Technology | OA question | 2025-08-08 |
Topics to prioritise
Graphs (Dijkstra, Bellman-Ford with stop limits, MST, topological sort, bottleneck paths), sliding windows, prefix counts, stack matching, plus everything on your resume.
The Codinzhub Next-Round Playbook
- Practise graph variants with an extra limit (k stops, k transfers); they appeared on three campuses.
- Solve standard DSA problems fast and cleanly; round 1 needs all three solved.
- Remove anything from your resume you cannot explain in depth.
About this guide
This guide is researched and written by the Codinzhub team from questions and experiences IIT students shared on Codinzhub. Questions are our own short summaries; the practice links open the full question on Codinzhub. Sat this OA or the interviews? Share your experience on Codinzhub and we will update the guide.
Keep track of what you’ve learned.