Jobra
🐞Step 1 of Jobra:AI Debugging Rounds
DSA+AIPreparing you for both.
JOBRA · AI DEBUG ROUND (PREVIEW)sum.cpp
// buggy snippet
int total(vector<int>& a, int n) {
    int sum = 0;
    for (int i = 0; i <= n; i++) { // 🐞        sum += a[i];
    }
    return sum;
}
A real codebase. A real bug. You + AI.

Jobra drops you into a broken repo. Find it, fix it, ship it. AI helps you debug like on the job.

Prompt:Correct the loop condition
Tap 'Let Jobra fix it' below to simulate AI debugging...

InMobi SDE 1 Campus Guide: Three-Question OA, a DSA and Debugging Round, Then Your Resume

7 min read

Prepare for InMobi software engineer interviews with reported assessment patterns, interview questions, and preparation advice.

In this article
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 itPractice
1A circular array of nodes, each covering a range; fewest nodes to switch on so every position is coveredTurn ranges into intervals on a doubled array; greedy interval coverMinimum Nodes to Activate
2Largest sum of a "trionic" subarray: strictly up, then strictly down, then strictly upDP over the three phasesTrionic Array II
3Count subarrays with exactly k odd numbersPrefix 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 itPractice
Each task ID appears twice in a list; remove the fewest so the list is a valid nested sequenceStack, like matching bracketsRepair the Track Stack
Send ad campaign data from server S to D through a network under limitsGraph shortest or widest pathAdvertiser Ad Campaign
Cheapest flight within K stopsBellman-Ford for K + 1 rounds, or BFS by stopsCheapest Flights Within K Stops
Connect all servers at minimum costMinimum spanning treeMinimum Networking
Intervals given as pairs of equal IDs; count common or overlapping onesPositions of each ID, then sweepCommon Intervals

IIT Bombay, October 23

Question (our summary)How to approach itPractice
Huts on a tree of trails; choose subsidised trail permits to minimise costTree DP or DFS with path countsSubsidised Trail Permits
Widest crate that can travel between depots using at most k belt transfersBottleneck 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 ruleGreedy left to rightMinimum Badges on the Packing Line

IIT Delhi, October 25

Question (our summary)How to approach itPractice
Word ladder where changing each letter position has its own costDijkstra over wordsWord Ladder with Per-Index Cost
Count ways to pick at least k non-overlapping subsequence copies of a pattern in a logDP on positions and copiesNon-Overlapping Pattern Occurrences
Order company audits by dependencies; report a cycle if there is oneTopological sort with cycle detectionCompany 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 experienceCollege or driveTypePosted
SDE 1Not statedInterview experience2026-11-05
Inmobi Interview Experience SDE 1 On Campus 2026 2027Not statedInterview experience2026-11-03
Inmobi SDE 1 Interview ExperienceNot statedInterview experience2026-10-23
Minimum Removals to Make a Valid Stack SequenceIIT BombayOA question2026-10-10
Minimum Number of Police Officers to Cover All CheckpointsIIT BombayOA question2026-10-10
Maximum Number of Concurrent Operations Under a BudgetIIT BombayOA question2026-10-10
Probability of Reaching a Target Node in a TreeIIT HyderabadOA question2026-10-09
Probability of Reaching a Target Node in a TreeIIT HyderabadOA question2026-10-09
Minimum Operations to Zero All Node OffsetsIIT HyderabadOA question2026-10-09
Minimum Operations to Zero All Node OffsetsIIT HyderabadOA question2026-10-09
Minimum Operations to Make All Tree Node Values ZeroIIT HyderabadOA question2026-10-09
Maximum Number of Tiles That Can FallIIT HyderabadOA question2026-10-09
Maximum Number of Tiles That Can FallIIT HyderabadOA question2026-10-09
Frog Position After T SecondsIIT HyderabadOA question2026-10-09
Domino TopplingIIT HyderabadOA question2026-10-09
sum of subarray maximumIIT RoorkeeOA question2026-10-07
subarray maximumsIIT RoorkeeOA question2026-10-07
Trionic Array 2IIT (BHU) VaranasiOA question2026-10-07
Sum of Max of all sub arraysIIT RoorkeeOA question2026-10-07
Max CTRIIT RoorkeeOA question2026-10-07
GPU Priority SchedulingIIT RoorkeeOA question2026-10-07
Count subarrays with K odd numbersIIT (BHU) VaranasiOA question2026-10-07
GPU Cluster Job SchedulerIIT RoorkeeOA question2026-10-06
minimum towers to turn on to cover allIIT (BHU) VaranasiOA question2026-10-05
count subarrays with at most k odd numbersIIT (BHU) VaranasiOA question2026-10-05
count nice arrayIIT (BHU) VaranasiOA question2026-10-05
Trionic array 2IIT (BHU) VaranasiOA question2026-10-05
Trionic Array-2 LeetcodeIIT (BHU) VaranasiOA question2026-10-05
Trionic Array IIIIT (BHU) VaranasiOA question2026-10-05
Sum of Subarray Maximums (IIT BHU OA)IIT BHU OA) InmobiOA question2026-10-05
Sub array maximumIIT RoorkeeOA question2026-10-05
Something like neutralize circular towersIIT (BHU) VaranasiOA question2026-10-05
Number of Subarrays with Exactly K Odd NumbersIIT (BHU) VaranasiOA question2026-10-05
Minimum TowersIIT (BHU) VaranasiOA question2026-10-05
Minimum Elements to Cover a Circular ArrayIIT (BHU) VaranasiOA question2026-10-05
Maximum Sum of an Up-Down-Up SubarrayIIT (BHU) VaranasiOA question2026-10-05
Maximum Sum of an Up-Down-Up SubarrayIIT (BHU) VaranasiOA question2026-10-05
GPU process schedulingIIT RoorkeeOA question2026-10-05
GPU Memory Reservation PlannerIIT RoorkeeOA question2026-10-05
GPU Cluster Job SchedulerIIT RoorkeeOA question2026-10-05
Count nice subarryasIIT (BHU) VaranasiOA question2026-10-05
Count Number of Nice subarraysIIT (BHU) VaranasiOA question2026-10-05
Count Number of Nice SubarraysIIT (BHU) VaranasiOA question2026-10-05
Count Number of Nice SubarraysIIT (BHU) VaranasiOA question2026-10-05
Compaign wave analyzerIIT (BHU) VaranasiOA question2026-10-05
Circular defenceIIT (BHU) VaranasiOA question2026-10-05
Circular DefenseIIT (BHU) VaranasiOA question2026-10-05
Campaign performanceIIT RoorkeeOA question2026-10-05
Campaign Wave AnalyzerIIT (BHU) VaranasiOA question2026-10-05
Campaign CTR LeaderboardIIT RoorkeeOA question2026-10-05
3640. Trionic Array IIIIT (BHU) VaranasiOA question2026-10-05
Idle GPU Priority Scheduling on a Shared GPU ClusterIIT RoorkeeOA question2026-10-04
InMobi Interview Experience for SDE-I (on-campus)IIT RInterview experience2026-09-29
Swapped Neighbour ScansIIT Kanpur 24th SeptemberOA question2026-09-27
Snapshot Upload 2026-09-27 17:38:03Not statedOA question2026-09-27
Snapshot Upload 2026-09-27 17:37:35Not statedOA question2026-09-27
Snapshot Upload 2026-09-27 17:37:13Not statedOA question2026-09-27
Snapshot Upload 2026-09-27 17:35:57Not statedOA question2026-09-27
Peak Profit WindowIIT Kanpur 24th SeptemberOA question2026-09-27
Cold StartIIT Kanpur 24th SeptemberOA question2026-09-27
Inmobi Online AssessmentIIT RoorkeeOA question2026-09-26
Implement DiscountEngine with Rule MatchingIIT RoorkeeOA question2026-09-26
DiscountTracker System DesignIIT RoorkeeOA question2026-09-26
Best Sum Any Tree PathIIT RoorkeeOA question2026-09-26
Median Of Three Sorted ArraysIIT GandhinagarOA question2026-09-25
Matrix kth smallest valueIIT GandhinagarOA question2026-09-25
Inmobi Online AssessmentIIT KanpurOA question2026-09-25
Inmobi Online AssessmentIIT KanpurOA question2026-09-25
Inmobi Online AssessmentIIT KanpurOA question2026-09-25
Exit Entry MandateIIT Kanpur QOA question2026-09-25
Longest Valid Parentheses SubstringMNNITOA question2026-09-20
Inmbi Online AssessmentMNNITOA question2026-09-20
InMobi SDE 1 Interview Experience Full Interview Experience Upto Hr RoundIIT (BHU) VaranasiInterview experience2026-09-20
Alternating Level Sum in a Binary TreeMNNITOA question2026-09-20
Q3Not statedOA question2026-09-05
Q2Not statedOA question2026-09-05
Q1Not statedOA question2026-09-05
Maximize Impression ValueIIT BHUOA question2026-08-05
InMobi Supply Path Optimization ProblemIIT BHUOA question2026-08-05
Inmobi SDE Interview ExperienceNot statedInterview experience2026-04-13
X of a Kind in a Deck of CardsNot statedOA question2026-03-19
IPONot statedOA question2026-03-19
Find the Probability to Reach the Target NodeNot statedOA question2026-03-19
Find Missing and Duplicate IntegerNot statedOA question2026-03-19
Bus Station Seat AllotmentNot statedOA question2026-03-19
projects from cses sheetIndian Institute of TechnologyOA question2025-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.

Ready for the next topic?

Keep track of what you’ve learned.