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...

How to Crack InMobi: The Software Engineer (SDE 1) Interview, From Real Experiences

22 min read

InMobi SDE 1 interview guide: reported OA, technical and HR rounds, real coding questions, CS fundamentals, practice links and an honest coverage check.

In this article
On this page

Last reviewed November 19, 2026 · 25 min read · For candidates targeting SDE 1 / new-grad Software Engineer roles in India

Researched and written by the Codinzhub Editorial Team from nine independent sources: eight candidate accounts and one public question catalogue. Every question below is a verbatim report or a faithful paraphrase; nothing was invented to fill a round. Hiring formats change by team and year, so confirm your loop with your recruiter.

The 30-second version: In the reviewed SDE 1 accounts, the path typically starts with an online assessment (OA) of three coding questions (90 minutes in the 2026 account), then one or two 45–60 minute technical rounds and an HR conversation. The technical rounds are not pure LeetCode: they mix DSA with a project deep dive and CS fundamentals such as DBMS, operating systems and OOP. One 2026 loop had four stages; another had two. Code is often written in a shared Google Doc, so practise narrating while you type and dry-running without a compiler. The highest-leverage habit: agree on the approach and state the complexity before you write a line.

Important things to know before the interview

[!IMPORTANT] The OA is a speed test, not a single puzzle. The 2024 and 2026 accounts that describe the OA both report three coding questions; the 2026 account gives 90 minutes. A 2021 account describes three questions in two hours on DoSelect; a 2016 account describes 25 MCQs in 20 minutes plus two coding tasks. The constant is time pressure across independent problems.

[!WARNING] The technical round may happen in a shared Google Doc. A 2026 account describes coding with no autocomplete, syntax highlighting or compiler. Practise writing clean code in a plain document and tracing it by hand.

[!TIP] Your projects are part of the technical bar. Two 2026 accounts spent a substantial part of a technical round on architecture, contribution, implementation choices and scaling. One 2025 account tied a rejection to an inability to explain projects deeply.

[!NOTE] CS fundamentals appear inside coding rounds. OOP, DBMS, operating systems, SQL, locks, ACID properties, concurrency and networking came up alongside DSA. Do not leave these until HR; there may be no separate theory round.

What this guide covers

InMobi can look unpredictable: sometimes two rounds, sometimes four, sometimes a project discussion. The reports show a smaller repeatable core.

This guide is built from nine independent sources covering InMobi Software Engineer, SDE and SDE 1 hiring in India from 2016 to 2026, five dated 2024–2026. It is not a leaked question bank, an official statement, or a pass-rate estimate. Funnels such as “120 students to 18” describe one campus, not the company.

Scope: Software Engineer / SDE 1 / new-grad roles in India. The SDE Intern, Machine Learning Engineer and SDE 2 loops are excluded. Campus and off-campus routes differ, and the 2026 accounts disagree on the number of rounds. Confirm your sequence with your recruiter.

Selected vs. rejected: do this, not that

These habits come from accepted and rejected accounts. No selected candidate described a flawless interview; the difference was disciplined habits.

Do this (selected candidates)Not that (rejected candidates)Why it matters
Clarify the approach first, including bounds and edge cases.Start typing immediately; one 2026 interviewer had to ask the candidate to code first.The interviewer is judging reasoning.
Code while narrating variable names and invariants.Work in silence and hide your reasoning.With no compiler, narration is the running commentary.
State time and space complexity unprompted.Wait to be asked and then cannot cost recursion or a hash map.Complexity was explicitly requested.
Know the project end to end: architecture, contribution, trade-offs, scaling.Give a shallow summary and stall on “how would you scale this?”.Projects were a proxy for ownership in 2025–2026.
Ship a working baseline, then optimise when asked.Chase the optimal trick first, get stuck and lose time.A baseline proves competence; optimisation proves depth.

Round-by-round breakdown

The order comes from candidate accounts, not a published official sequence. One 2026 loop had an OA, two technical rounds and HR; another 2026 loop had a bar-raiser-style coding round and a hiring-manager conversation.

Stage 1: Application

Most reviewed candidates entered through a campus drive; a smaller number applied directly off-campus. No SDE 1 account described a successful employee referral, so referral is not presented as a proven route.

ChannelWhat candidates reported
On-campus driveThe dominant route. One 2024 account reported 120 applicants, 18 shortlisted and 5 final selections.
Off-campus / directOne 2026 account reached a coding round plus a hiring-manager-style conversation.
Employee referralNot attested for SDE 1. One SDE 2 account used one, but that is a different level.

What helped: a one-page resume with projects you can defend, and a clear primary programming language.

Stage 2: Shortlisting

Shortlisting was driven by resume screening and the OA. No SDE 1 candidate described a separate recruiter phone screen; the recruiter call appears only in an SDE 2 account outside this guide's scope.

  • Resume shortlist: campus eligibility and resume screening decide who receives the OA; one 2024 account describes a pool of 120 students.
  • OA cutoff: in the 2024 and 2026 accounts, candidates who solved all three questions moved forward. One 2026 account reports 40 shortlisted.
  • Later cuts: the same account reports about 15 students after the first technical round and 10 after the second. A 2021 account reports 25 candidates plus 25 on an extended list.

These are individual campus reports, not company-wide conversion rates.

Stage 3: Online assessment (OA)

How it works. The OA is a timed test with multiple independent problems. The 2024 and 2026 accounts both report three DSA questions; the 2026 account gives 90 minutes. A 2021 account used DoSelect with three questions in two hours; a 2016 account used HackerRank with 25 MCQs in 20 minutes plus two coding tasks. Difficulty clusters around LeetCode medium, with occasional medium-hard questions. One 2024 account lost a single hidden case on a ratio problem and still advanced, so partial credit may exist — but do not rely on it.

At a glance: 90 minutes and 3 problems in most recent accounts; DoSelect (2021), HackerRank (2016), platform not reported in 2024–2026. Topics: arrays, strings and sliding windows, graphs, trees, DP, heaps, topological sort.

Question summarySkill or patternReported follow-upLevel / scopePractice link
Count the subsets of an integer array whose sum equals a target.Subsets / recursion / DPNot reportedSDE 1Partition Equal Subset Sum
Classify a sequence as AP, GP or Fibonacci-style and return the next term; return -999 if none fits.Maths / pattern recognitionFibonacci need not start at 0; 8, 9, 17 is validSDE 1No verified practice match
Multi-source BFS on a 1-D array, similar to Rotten Oranges.BFS / queueNot reportedSDE 1Rotting Oranges
Sliding-window string problem similar to Minimum Window Substring.Sliding window / frequency mapNot reportedSDE 1Minimum Window Substring
For every tree node, compute the sum of distances to all other nodes.Tree DP / rerootingNot reportedSDE 1Sum of Distances in Tree
Connect N ropes with minimum total cost; parse a comma-separated input first.Min-heap / greedy / parsingParsing is part of the taskSDE 1Minimum Cost to Connect Sticks
Find the cheapest flight from a source to a destination with at most K stops.Graph shortest path / BFSNot reportedSDE 1Cheapest Flights Within K Stops
Decide whether all courses can be finished given prerequisite pairs.Topological sort / graphNot reportedSDE 1Course Schedule

InMobi OA questions shared on Codinzhub:

QuestionDriveTopic
Sum of Subarray MaximumsIIT DelhiMonotonic stack
Maximum Campaign Click-Through RateIIT DelhiSliding window, greedy
Multiprocessor Job SchedulingIIT DelhiHeap, scheduling
Minimum NetworkingIIT KharagpurGraphs, MST
Cheapest Flights Within K StopsIIT KharagpurGraph shortest path
Common IntervalsIIT KharagpurIntervals, sorting
Company Audit Order With Cycle DetectionIIT DelhiTopological sort
Word Ladder With Per-Index Change CostIIT DelhiBFS, strings
Median of Three Sorted ArraysIIT GandhinagarBinary search
K-th Smallest Value in a MatrixIIT GandhinagarHeap, binary search

Full InMobi interview experiences on Codinzhub: SDE 1, IIT (BHU) Varanasi (2026), SDE 1 (2026), SDE 1, on campus (2026-2027), SDE 1, full loop to HR, IIT (BHU) Varanasi.

More Codinzhub questions: Browse InMobi questions.

Stage 4: Technical round 1

How it works. This is the first conversation after the OA: an introduction, a project deep dive, one or two coding questions, CS fundamentals and a short “any questions?” close. In the 2026 account the interviewer shared a Google Doc; a 2021 account ran on MS Teams. The interviewer may push back before letting you code: one 2026 candidate was asked to start coding because the spoken approach was not yet convincing, then had to optimise afterwards.

At a glance: 45–60 minutes; 1–2 coding questions plus projects and fundamentals; Google Doc in 2025–2026, MS Teams in 2021. Topics: tree DP, backtracking, DP, linked lists, stacks, DBMS/SQL, OS, OOP, projects.

Question summarySkill or patternReported follow-upLevel / scopePractice link
Maximum sum of nodes in a binary tree such that no two selected nodes are adjacent.Tree DP / recursionComplexity; OOP and OS questions followedSDE 1GeeksforGeeks problem
Word Squares: given equal-length strings, return every grid where row i equals column i.Backtracking / trieOptimise after the first working solutionSDE 1Word Squares
Count unique paths in a grid, then extend the solution to grids with obstacles.DP / grid recursionObstacle follow-up; recursive, memoised and iterative versionsSDE 1Unique Paths
Count the ways a batsman can reach a target score using only 1s, 4s and 6s.DP / coin changeRecursive and iterative versionsSDE 1Combination Sum IV
Rotate a sentence of space-separated words; show all solutions, not only the optimal one.Strings / rotationInterviewer wanted multiple approachesSDE 1Rotate String
Convert a Roman numeral string to an integer.Strings / hash mapNot reportedSDE 1Roman to Integer
Design employee and department tables, first 1:N then M:N, and query employees in a department.SQL / schema designRelationship changes from 1:N to M:NNew GradNo verified practice match
Design a quiz class with random numbers and an operator, a timer, score tracking and retry; then find bugs in your code.OOP / state design10 minutes to find bugs in your own designNew GradNo verified practice match

Stage 5: Technical round 2 / managerial

How it works. This round is less uniform. One 2026 account calls it pure DSA with no project or CS questions. Others combine DSA with design concepts, a class-design task, or scaling the candidate's project. In the 2026 off-campus account, the second conversation was with an employee with six years of experience and focused on projects, OS/DBMS concepts and a flight-ticket booking class. Expect probing until the design has clear data structures and invariants.

At a glance: 45–60 minutes; 1–2 coding questions plus a design discussion in several accounts; on-site or shared editor. Topics: stacks, matrix BFS, monotonic stacks, sliding window with geometry, linked lists, class design, system-design fundamentals.

Question summarySkill or patternReported follow-upLevel / scopePractice link
Find the longest valid parentheses substring; discuss brute force, O(N) stack and O(1)-space solutions.Stack / string / DPBrute force, stack O(N), then space optimisationSDE 1Longest Valid Parentheses
In a 2D grid, simulate virus infection spreading to adjacent cells each minute.Multi-source BFS / matrixNot reportedSDE 1Rotting Oranges
For every element, find the next smaller element; then optimise to constant extra space.Monotonic stackConstant-space optimisation after hintsSDE 1No verified practice match
Given points and a viewing angle, find the maximum number of points visible from one position.Sliding window on angles / geometryMathematical observation before the windowSDE 1Maximum Number of Visible Points
Delete the Nth node from the end of a singly linked list.Linked list / two pointersNot reportedSDE 1Remove Nth Node From End
Design a hospital appointment system with priorities; justify the data structures and OOP model.Design / OOP / priority queueDiscussion focused on data structures and OOPSDE 1No verified practice match
Implement a flight-ticket booking class that can book, cancel, check availability and fetch all tickets.OOP / class designDesign revolved around one of the candidate's projectsSoftware EngineerNo verified practice match
Find the next greater number using the same set of digits.Strings / permutation / stackNot reportedSoftware EngineerGeeksforGeeks problem

Stage 6: HR and behavioral

How it works. The HR round is conversational, not a coding test. One 2026 account describes a 30-minute discussion of college incidents, the journey to IIT, strengths and weaknesses, and questions for the interviewer. A 2021 account describes a relaxed 10-minute conversation about background, projects and hobbies; another describes a 45-minute round testing reactions to situations. The interviewer is checking motivation, communication and fit, not a rehearsed script.

At a glance: 30–45 minutes (one account reports 10); 6–10 conversational questions on background, motivation, strengths and weaknesses, college stories, hobbies, why InMobi and situational judgement.

Question summarySkill or patternReported follow-upLevel / scopePractice link
Tell me about yourself and walk me through your resume.Self-introductionNot reportedSDE 1No verified practice match
Tell me about an interesting incident from your college life.Storytelling / personalityNot reportedNew GradNo verified practice match
What are your strengths and weaknesses?Self-awarenessNot reportedSDE 1No verified practice match
Why do you want to join InMobi?Motivation / company fitNot reportedSDE 1No verified practice match
What challenges have you faced, and how did you handle them?Behavioural / ownershipNot reportedSoftware EngineerNo verified practice match
Do you have any questions for us?Engagement / curiosityCandidate asked about the company and the interviewer's journeySDE 1No verified practice match

Candidate experiences reviewed

The nine sources span campus and off-campus routes, selected and rejected candidates, and roles titled Software Engineer, SDE and SDE 1. Four representative entries:

BackgroundRole and reported outcomeWhat was asked
IIT (ISM) Dhanbad · 2026Software Engineer, off-campus · RejectedSliding window, projects, OS/DBMS, flight-ticket booking class
IIT Indore · 2026SDE, campus · RejectedDSA, OOP/DBMS/OS, project architecture, SQL, debugging
IIT BHU · 2026SDE, off-campus · SelectedTree DP in a Google Doc, Word Squares, OOP/OS, HR
Not stated · 2024SDE 1, campus · SelectedRatio and sliding-window OA, Rotate String, Roman to Integer, linked list, design concepts

The Codinzhub next-round playbook

To get past the online assessment

  1. Train on three problems in 90 minutes. Sit one timed set of two medium and one medium-hard problem with no hints. The OA rewards finishing multiple independent tasks.
  2. Practise input parsing and graph drawing. The Connect N Ropes account mentions a comma-separated input catch; when a problem mentions dependencies or shortest steps, draw the graph first.

To get past technical round 1

  1. Prepare a three-minute project story for every resume bullet: problem, architecture, your contribution, hardest bug and one change you would make, plus a two-minute scaling answer.
  2. Revise DBMS, OS and OOP in interview form: ACID with a transaction example, locks and mutual exclusion, paging versus segmentation, and the four OOP pillars with a project example.
  3. Practise tree DP and backtracking out loud. Maximum sum of non-adjacent nodes and Word Squares reward a clear invariant before code.

To get past technical round 2

  1. Code without a compiler. In a plain editor, write the signature, edge-case guards and main loop, then trace a three-element example.
  2. Rehearse class design. For a booking, appointment or quiz class, list entities, state, methods and method complexity before writing code.
  3. Practise the “optimise after working” conversation. Solve the baseline, state its complexity, then propose one improvement and its trade-off.

To get past the HR round

  1. Prepare six STAR stories (below) and use “I” for your own contribution.
  2. Prepare two questions about the company and stay calm if the interviewer probes. One account describes deliberate awkwardness; answer frankly and admit what you do not know.

How the loop differs by level

LevelTypical experienceWhat the accounts emphasiseSystem design expectation
SDE InternCurrent studentDSA and project fundamentals; needs a separate intern guide.Not a standalone round.
SDE 1 / New Grad0 to 1 yearDSA, CS fundamentals, project ownership, short HR.Embedded as a class-design or scaling discussion.
SDE 22 to 4 yearsBar-raiser coding, deeper DSA, hiring-manager conversation.More design, not generalised to SDE 1.
SDE 3+SeniorNot covered by this dataset.Not covered.

Campus drives use a resume shortlist, shared OA and several fast technical rounds with a large pool. Off-campus hiring in the 2026 account used fewer, longer conversations. Do not assume the campus four-stage sequence applies.

Most-asked topics

TopicWhat it means in plain EnglishEvidence-backed priorityReported examplesPractice
Trees and recursionTraversing parent-child structures and returning a value upward from each subtree.Very high — multiple technical and OA accountsMax sum of non-adjacent nodes, tree distances, top viewTree problems
Graphs (BFS, DFS, topological sort)Modelling connections and finding reachability, shortest steps or dependency order.Very high — OA and technical roundsCourse Schedule, virus spread, cheapest flightsGraph problems
Arrays, strings, sliding windowsMaintaining a moving range or frequency map over a sequence.High — OA and early technical roundsMinimum Window Substring, rotate words, longest valid parenthesesSliding window
Dynamic programmingBreaking a problem into overlapping subproblems and reusing results.High — OA and technical roundsUnique Paths, batsman scoring, House RobberDP problems
Stacks and monotonic stacksTracking unresolved elements or the next smaller/larger value.High — later technical roundsNext smaller element, longest balanced parentheses, next greater numberStack problems
Heaps and intervalsRepeatedly taking the smallest/largest item, or scheduling overlaps.Medium — OA and later roundsConnect N Ropes, minimum platforms, IPOHeap problems
CS fundamentals and projectsDBMS, OS, OOP, concurrency and defending your own work.Very high — recurring differentiatorACID, locks, SQL schema, multithreading, project scalingNo direct practice link

The question patterns that keep coming back

1. Tree DP with a return contract

  • How to recognise it: a binary tree and an optimal selection, path or distance, often with a restriction such as “no two adjacent nodes”.
  • The invariant: return two values to the parent — the best total when the current node is selected and when it is not.
  • Reported examples: maximum sum of non-adjacent nodes, sum of distances to all nodes, top view.
  • Preparation action: say aloud what the function returns before coding; test a single node and a two-level tree.

2. Grid and graph traversal

  • How to recognise it: cells, neighbours, infection, islands, paths or prerequisites.
  • The invariant: unweighted shortest steps means BFS; reachability means DFS or union-find; dependency order means topological sort.
  • Preparation action: draw the graph, mark the source set, and decide whether you need visited, distance or both.

3. Counting with DP or prefix state

  • How to recognise it: “how many ways”, “number of subsets” or “count subarrays” with a sum, XOR or score condition.
  • The invariant: define the state, transition and base case. A running prefix plus a hash map often turns O(N²) subarray counts into O(N).
  • Preparation action: write the recurrence in words, then test empty and one-element inputs.

4. Stack-based next-element problems

  • How to recognise it: next greater/smaller element, a longest valid parenthesis run, or a monotonic property over a sequence.
  • The invariant: keep unresolved indices on a stack; when the current element resolves them, pop and record. Each element is pushed and popped once, giving O(N).
  • Preparation action: trace the stack by hand on a five-element example before writing the loop.

5. Class design with explicit state

  • How to recognise it: implement an object with operations such as book, cancel, check, push, pop or score.
  • The invariant: name the entities, the state each owns, the invariants that must hold, and the complexity of every method.
  • Preparation action: write a class skeleton with fields and signatures first, then implement one method at a time.

Preparing for InMobi values and behavioral rounds

The HR round is scored. Interviewers asked about strengths, weaknesses, college experiences, challenges and reactions to situations. One account describes an interviewer deliberately trying to make the conversation awkward; the candidate's advice was to stay calm, be frank and admit when a topic was unfamiliar.

[!WARNING] Do not treat HR as a filler round. The dataset has no SDE 1 rejection attributed solely to HR, so this is not a claim that HR caused a rejection. It is a warning that defensive or team-blaming answers are a needless risk.

Core themes: self-awareness, motivation beyond “it is a good company”, ownership, collaboration and composure under ambiguity.

The six STAR stories to prepare

Use STAR: Situation, Task, Action, Result.

#Story promptFocus area
1A time you disagreed with a teammate's technical proposal.Conflict resolution
2A time you received difficult constructive feedback.Coachability
3A project you owned that failed or missed a deadline.Ownership
4A feature you built with ambiguous requirements.Autonomy
5A time you helped a teammate succeed.Team-first mentality
6A speed-versus-quality trade-off you made.Engineering maturity

Practice problems that match these experiences

Note on practice analogues: These problems share the algorithmic invariants in candidate accounts. Unless marked “Exact reported problem”, they are practice analogues, not leaked exam questions.

#Practice problemPatternSeen in these experiences asLink
1Maximum sum of non-adjacent tree nodesTree DPSelecting tree nodes with no two adjacentGeeksforGeeks
2Word SquaresBacktracking / trieGrids where rows equal columnsLeetCode #425
3Course ScheduleTopological sortPrerequisite validationLeetCode #207
4Rotting OrangesMulti-source BFSInfection spread on a grid or 1-D arrayLeetCode #994
5Longest Valid ParenthesesStack / DPLongest balanced parenthesis substringLeetCode #32
6Unique PathsGrid DPCounting right/down pathsLeetCode #62
7House Robber1-D DPMaximum sum with an adjacency restrictionLeetCode #198
8Cheapest Flights Within K StopsGraph shortest pathCheapest route with a stop limitLeetCode #787
9Minimum Window SubstringSliding windowShortest window containing a target setLeetCode #76
10Maximum Number of Visible PointsSliding window / geometryVisible points inside a viewing angleLeetCode #1610

How to handle a question you have never seen

  1. Repeat and clarify (0–3 minutes). Rephrase the problem. Ask about empty inputs, negatives, duplicates, sortedness and the maximum input size. If N is up to 10^5, rule out O(N²) early.
  2. State the brute-force baseline (3–5 minutes). Never sit in silence. Describe the naive solution and its complexity: “Checking every pair would take O(N²) time and O(1) extra space.”
  3. Name the bottleneck (5–8 minutes). Repeated lookups suggest a hash map; repeated min/max extraction suggests a heap; recalculated ranges suggest prefix sums or a sliding window; dependency order suggests topological sort.
  4. Code in clean, modular steps (8–25 minutes). Talk while you type. Use meaningful names, state invariants in comments and write edge-case guards first.
  5. Dry-run line by line (25–30 minutes). Pick a three-element or 2×2 example and trace every variable on screen. If you catch a bug, say so calmly and fix it.
  6. State final complexity proactively (30–32 minutes). Give time and space complexity and name the trade-off: “This uses O(N) extra space for the map; sorting would use O(1) space at the cost of O(N log N) time.”

Common preparation mistakes

No SDE 1 account in this dataset included formal recruiter rejection feedback, so this section is editorial synthesis plus one candidate's self-reflection. Treat it as preparation advice, not a claim about why any specific person was rejected.

  1. Treating the project discussion as a formality. One 2025 account linked rejection to an inability to explain projects deeply; two 2026 accounts spent a large part of a technical round on architecture and scaling.
  2. Jumping to code before agreeing on the approach. In a 2026 account, the interviewer was not convinced by the spoken approach and asked the candidate to code first.
  3. Underestimating CS fundamentals. DBMS, OS, OOP, SQL, locks, ACID and concurrency appeared inside technical rounds. Explain each with a project example, not a textbook definition.
  4. Writing code silently in a shared document. The Google Doc removes compiler feedback, so narrate decisions and dry-run aloud.
  5. Chasing the optimal solution immediately. Deliver the baseline, state its complexity, then improve it when asked.

If you remember only five things

  1. Train for three problems in 90 minutes, not one perfect solution.
  2. Practise in a plain Google Doc; narrate while you type.
  3. Prepare your projects like a technical subject: architecture, contribution, trade-offs, scaling.
  4. Revise DBMS, OS and OOP alongside DSA; they appear inside technical rounds.
  5. Rehearse six STAR stories and two questions for the interviewer.

Frequently asked questions (FAQ)

Is there always an online assessment?

In the reviewed campus accounts, yes: the OA is the first filter. The 2026 off-campus account began with a bar-raiser-style coding round instead. Confirm with your recruiter.

How many rounds does the InMobi SDE 1 process have?

The accounts disagree. One 2026 loop had an OA, two technical rounds and HR. Another 2026 loop had two conversations. A 2024 campus account had an OA, a technical round, a tech/managerial round and HR.

Which programming language should I use?

No InMobi-specific restriction appears in the reviewed accounts. Choose the language you write fastest and explain most clearly. Because the round may use a shared document, Python or Java reduces the code you type and debug by eye.

Is system design asked for SDE 1?

Not as a separate architecture round. Design appears as a class-design task or project-scaling discussion, such as the flight-ticket booking class or hospital appointment system. Prepare low-level design, not distributed-systems architecture.

Will the interviewer give hints if I get stuck?

In several accounts the interviewer intervened with a hint or a direction change, especially on an approach or optimisation. Keep talking so the interviewer has something to redirect.

Are the questions in this guide exact leaks?

No. They are verbatim reports or faithful paraphrases. Practice links are analogues unless marked “Exact reported problem”. Use the guide to recognise patterns, not to memorise answers.


About this guide and methodology

This guide was researched, compiled and audited by the Codinzhub Editorial Team. It synthesises nine independent sources — six internal records, two public candidate write-ups and one public catalogue — covering InMobi Software Engineer, SDE and SDE 1 hiring from 2016 to 2026. Five sources are dated 2024–2026.

All reported questions are verbatim accounts or faithful paraphrases. Practice mappings connect to LeetCode and GeeksforGeeks and are labelled exact or similar. No external research URLs, internal record identifiers or private source ledgers appear in this article; those are kept in the private research notes.

Disclaimer: Hiring policies, rubrics and interview structures change over time. This guide reflects reported historical experiences and is not an official statement from InMobi. Confirm the current stage format, platform and tooling with your recruiter.


Other company and role guides


Search the question bank

The questions from each round above, with practice links for similar problems. Log in to search every question we collected for this role, including questions shared on Codinzhub.

Showing 20 of 77 questions

  • Sum of Subarray Maximums

    A InMobi online assessment question shared on Codinzhub (IIT Delhi).

    On CodinzhubIIT DelhiMonotonic stackCodingOnline assessment
  • Maximum Campaign Click-Through Rate

    A InMobi online assessment question shared on Codinzhub (IIT Delhi).

    On CodinzhubIIT DelhiSliding window, greedyCodingOnline assessment
  • Multiprocessor Job Scheduling

    A InMobi online assessment question shared on Codinzhub (IIT Delhi).

    On CodinzhubIIT DelhiHeap, schedulingCodingOnline assessment
  • Minimum Networking

    A InMobi online assessment question shared on Codinzhub (IIT Kharagpur).

    On CodinzhubIIT KharagpurGraphs, MSTCodingOnline assessment
  • Cheapest Flights Within K Stops

    A InMobi online assessment question shared on Codinzhub (IIT Kharagpur).

    On CodinzhubIIT KharagpurGraph shortest pathCodingOnline assessment
  • Common Intervals

    A InMobi online assessment question shared on Codinzhub (IIT Kharagpur).

    On CodinzhubIIT KharagpurIntervals, sortingCodingOnline assessment
  • Company Audit Order With Cycle Detection

    A InMobi online assessment question shared on Codinzhub (IIT Delhi).

    On CodinzhubIIT DelhiTopological sortCodingOnline assessment
  • Word Ladder With Per-Index Change Cost

    A InMobi online assessment question shared on Codinzhub (IIT Delhi).

    On CodinzhubIIT DelhiBFS, stringsCodingOnline assessment
  • Median of Three Sorted Arrays

    A InMobi online assessment question shared on Codinzhub (IIT Gandhinagar).

    On CodinzhubIIT GandhinagarBinary searchCodingOnline assessment
  • K-th Smallest Value in a Matrix

    A InMobi online assessment question shared on Codinzhub (IIT Gandhinagar).

    On CodinzhubIIT GandhinagarHeap, binary searchCodingOnline assessment
  • Count the subsets of an integer array whose sum equals a target.

    Level: Not reported.

    Subsets / recursion / DPCodingOnline assessment
  • Classify a sequence as AP, GP or Fibonacci-style and return the next term; return -999 if none fits.

    Level: Fibonacci need not start at 0; 8, 9, 17 is valid.

    Maths / pattern recognitionCodingOnline assessment
  • Multi-source BFS on a 1-D array, similar to Rotten Oranges.

    Level: Not reported.

    BFS / queueCodingOnline assessment
  • Sliding-window string problem similar to Minimum Window Substring.

    Level: Not reported.

    Sliding window / frequency mapCodingOnline assessment
  • For every tree node, compute the sum of distances to all other nodes.

    Level: Not reported.

    Tree DP / rerootingCodingOnline assessment
  • Connect N ropes with minimum total cost; parse a comma-separated input first.

    Level: Parsing is part of the task.

    Min-heap / greedy / parsingCodingOnline assessment
  • Find the cheapest flight from a source to a destination with at most K stops.

    Level: Not reported.

    Graph shortest path / BFSCodingOnline assessment
  • Decide whether all courses can be finished given prerequisite pairs.

    Level: Not reported.

    Topological sort / graphCodingOnline assessment
  • Maximum sum of nodes in a binary tree such that no two selected nodes are adjacent.

    Level: Complexity; OOP and OS questions followed.

    Tree DP / recursionCodingRound 1
  • Word Squares: given equal-length strings, return every grid where row i equals column i.

    Level: Optimise after the first working solution.

    Backtracking / trieCodingRound 1
Page 1 of 4

Keep preparing on Codinzhub

Ready for the next topic?

Keep track of what you’ve learned.