How to Crack InMobi: The Software Engineer (SDE 1) Interview, From Real Experiences
InMobi SDE 1 interview guide: reported OA, technical and HR rounds, real coding questions, CS fundamentals, practice links and an honest coverage check.
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.
| Channel | What candidates reported |
|---|---|
| On-campus drive | The dominant route. One 2024 account reported 120 applicants, 18 shortlisted and 5 final selections. |
| Off-campus / direct | One 2026 account reached a coding round plus a hiring-manager-style conversation. |
| Employee referral | Not 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 summary | Skill or pattern | Reported follow-up | Level / scope | Practice link |
|---|---|---|---|---|
| Count the subsets of an integer array whose sum equals a target. | Subsets / recursion / DP | Not reported | SDE 1 | Partition Equal Subset Sum |
| Classify a sequence as AP, GP or Fibonacci-style and return the next term; return -999 if none fits. | Maths / pattern recognition | Fibonacci need not start at 0; 8, 9, 17 is valid | SDE 1 | No verified practice match |
| Multi-source BFS on a 1-D array, similar to Rotten Oranges. | BFS / queue | Not reported | SDE 1 | Rotting Oranges |
| Sliding-window string problem similar to Minimum Window Substring. | Sliding window / frequency map | Not reported | SDE 1 | Minimum Window Substring |
| For every tree node, compute the sum of distances to all other nodes. | Tree DP / rerooting | Not reported | SDE 1 | Sum of Distances in Tree |
| Connect N ropes with minimum total cost; parse a comma-separated input first. | Min-heap / greedy / parsing | Parsing is part of the task | SDE 1 | Minimum Cost to Connect Sticks |
| Find the cheapest flight from a source to a destination with at most K stops. | Graph shortest path / BFS | Not reported | SDE 1 | Cheapest Flights Within K Stops |
| Decide whether all courses can be finished given prerequisite pairs. | Topological sort / graph | Not reported | SDE 1 | Course Schedule |
InMobi OA questions shared on Codinzhub:
| Question | Drive | Topic |
|---|---|---|
| Sum of Subarray Maximums | IIT Delhi | Monotonic stack |
| Maximum Campaign Click-Through Rate | IIT Delhi | Sliding window, greedy |
| Multiprocessor Job Scheduling | IIT Delhi | Heap, scheduling |
| Minimum Networking | IIT Kharagpur | Graphs, MST |
| Cheapest Flights Within K Stops | IIT Kharagpur | Graph shortest path |
| Common Intervals | IIT Kharagpur | Intervals, sorting |
| Company Audit Order With Cycle Detection | IIT Delhi | Topological sort |
| Word Ladder With Per-Index Change Cost | IIT Delhi | BFS, strings |
| Median of Three Sorted Arrays | IIT Gandhinagar | Binary search |
| K-th Smallest Value in a Matrix | IIT Gandhinagar | Heap, 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 summary | Skill or pattern | Reported follow-up | Level / scope | Practice link |
|---|---|---|---|---|
| Maximum sum of nodes in a binary tree such that no two selected nodes are adjacent. | Tree DP / recursion | Complexity; OOP and OS questions followed | SDE 1 | GeeksforGeeks problem |
| Word Squares: given equal-length strings, return every grid where row i equals column i. | Backtracking / trie | Optimise after the first working solution | SDE 1 | Word Squares |
| Count unique paths in a grid, then extend the solution to grids with obstacles. | DP / grid recursion | Obstacle follow-up; recursive, memoised and iterative versions | SDE 1 | Unique Paths |
| Count the ways a batsman can reach a target score using only 1s, 4s and 6s. | DP / coin change | Recursive and iterative versions | SDE 1 | Combination Sum IV |
| Rotate a sentence of space-separated words; show all solutions, not only the optimal one. | Strings / rotation | Interviewer wanted multiple approaches | SDE 1 | Rotate String |
| Convert a Roman numeral string to an integer. | Strings / hash map | Not reported | SDE 1 | Roman to Integer |
| Design employee and department tables, first 1:N then M:N, and query employees in a department. | SQL / schema design | Relationship changes from 1:N to M:N | New Grad | No 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 design | 10 minutes to find bugs in your own design | New Grad | No 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 summary | Skill or pattern | Reported follow-up | Level / scope | Practice link |
|---|---|---|---|---|
| Find the longest valid parentheses substring; discuss brute force, O(N) stack and O(1)-space solutions. | Stack / string / DP | Brute force, stack O(N), then space optimisation | SDE 1 | Longest Valid Parentheses |
| In a 2D grid, simulate virus infection spreading to adjacent cells each minute. | Multi-source BFS / matrix | Not reported | SDE 1 | Rotting Oranges |
| For every element, find the next smaller element; then optimise to constant extra space. | Monotonic stack | Constant-space optimisation after hints | SDE 1 | No verified practice match |
| Given points and a viewing angle, find the maximum number of points visible from one position. | Sliding window on angles / geometry | Mathematical observation before the window | SDE 1 | Maximum Number of Visible Points |
| Delete the Nth node from the end of a singly linked list. | Linked list / two pointers | Not reported | SDE 1 | Remove Nth Node From End |
| Design a hospital appointment system with priorities; justify the data structures and OOP model. | Design / OOP / priority queue | Discussion focused on data structures and OOP | SDE 1 | No verified practice match |
| Implement a flight-ticket booking class that can book, cancel, check availability and fetch all tickets. | OOP / class design | Design revolved around one of the candidate's projects | Software Engineer | No verified practice match |
| Find the next greater number using the same set of digits. | Strings / permutation / stack | Not reported | Software Engineer | GeeksforGeeks 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 summary | Skill or pattern | Reported follow-up | Level / scope | Practice link |
|---|---|---|---|---|
| Tell me about yourself and walk me through your resume. | Self-introduction | Not reported | SDE 1 | No verified practice match |
| Tell me about an interesting incident from your college life. | Storytelling / personality | Not reported | New Grad | No verified practice match |
| What are your strengths and weaknesses? | Self-awareness | Not reported | SDE 1 | No verified practice match |
| Why do you want to join InMobi? | Motivation / company fit | Not reported | SDE 1 | No verified practice match |
| What challenges have you faced, and how did you handle them? | Behavioural / ownership | Not reported | Software Engineer | No verified practice match |
| Do you have any questions for us? | Engagement / curiosity | Candidate asked about the company and the interviewer's journey | SDE 1 | No 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:
| Background | Role and reported outcome | What was asked |
|---|---|---|
| IIT (ISM) Dhanbad · 2026 | Software Engineer, off-campus · Rejected | Sliding window, projects, OS/DBMS, flight-ticket booking class |
| IIT Indore · 2026 | SDE, campus · Rejected | DSA, OOP/DBMS/OS, project architecture, SQL, debugging |
| IIT BHU · 2026 | SDE, off-campus · Selected | Tree DP in a Google Doc, Word Squares, OOP/OS, HR |
| Not stated · 2024 | SDE 1, campus · Selected | Ratio and sliding-window OA, Rotate String, Roman to Integer, linked list, design concepts |
The Codinzhub next-round playbook
To get past the online assessment
- 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.
- 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
- 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.
- 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.
- 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
- Code without a compiler. In a plain editor, write the signature, edge-case guards and main loop, then trace a three-element example.
- Rehearse class design. For a booking, appointment or quiz class, list entities, state, methods and method complexity before writing code.
- 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
- Prepare six STAR stories (below) and use “I” for your own contribution.
- 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
| Level | Typical experience | What the accounts emphasise | System design expectation |
|---|---|---|---|
| SDE Intern | Current student | DSA and project fundamentals; needs a separate intern guide. | Not a standalone round. |
| SDE 1 / New Grad | 0 to 1 year | DSA, CS fundamentals, project ownership, short HR. | Embedded as a class-design or scaling discussion. |
| SDE 2 | 2 to 4 years | Bar-raiser coding, deeper DSA, hiring-manager conversation. | More design, not generalised to SDE 1. |
| SDE 3+ | Senior | Not 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
| Topic | What it means in plain English | Evidence-backed priority | Reported examples | Practice |
|---|---|---|---|---|
| Trees and recursion | Traversing parent-child structures and returning a value upward from each subtree. | Very high — multiple technical and OA accounts | Max sum of non-adjacent nodes, tree distances, top view | Tree problems |
| Graphs (BFS, DFS, topological sort) | Modelling connections and finding reachability, shortest steps or dependency order. | Very high — OA and technical rounds | Course Schedule, virus spread, cheapest flights | Graph problems |
| Arrays, strings, sliding windows | Maintaining a moving range or frequency map over a sequence. | High — OA and early technical rounds | Minimum Window Substring, rotate words, longest valid parentheses | Sliding window |
| Dynamic programming | Breaking a problem into overlapping subproblems and reusing results. | High — OA and technical rounds | Unique Paths, batsman scoring, House Robber | DP problems |
| Stacks and monotonic stacks | Tracking unresolved elements or the next smaller/larger value. | High — later technical rounds | Next smaller element, longest balanced parentheses, next greater number | Stack problems |
| Heaps and intervals | Repeatedly taking the smallest/largest item, or scheduling overlaps. | Medium — OA and later rounds | Connect N Ropes, minimum platforms, IPO | Heap problems |
| CS fundamentals and projects | DBMS, OS, OOP, concurrency and defending your own work. | Very high — recurring differentiator | ACID, locks, SQL schema, multithreading, project scaling | No 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 prompt | Focus area |
|---|---|---|
| 1 | A time you disagreed with a teammate's technical proposal. | Conflict resolution |
| 2 | A time you received difficult constructive feedback. | Coachability |
| 3 | A project you owned that failed or missed a deadline. | Ownership |
| 4 | A feature you built with ambiguous requirements. | Autonomy |
| 5 | A time you helped a teammate succeed. | Team-first mentality |
| 6 | A 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 problem | Pattern | Seen in these experiences as | Link |
|---|---|---|---|---|
| 1 | Maximum sum of non-adjacent tree nodes | Tree DP | Selecting tree nodes with no two adjacent | GeeksforGeeks |
| 2 | Word Squares | Backtracking / trie | Grids where rows equal columns | LeetCode #425 |
| 3 | Course Schedule | Topological sort | Prerequisite validation | LeetCode #207 |
| 4 | Rotting Oranges | Multi-source BFS | Infection spread on a grid or 1-D array | LeetCode #994 |
| 5 | Longest Valid Parentheses | Stack / DP | Longest balanced parenthesis substring | LeetCode #32 |
| 6 | Unique Paths | Grid DP | Counting right/down paths | LeetCode #62 |
| 7 | House Robber | 1-D DP | Maximum sum with an adjacency restriction | LeetCode #198 |
| 8 | Cheapest Flights Within K Stops | Graph shortest path | Cheapest route with a stop limit | LeetCode #787 |
| 9 | Minimum Window Substring | Sliding window | Shortest window containing a target set | LeetCode #76 |
| 10 | Maximum Number of Visible Points | Sliding window / geometry | Visible points inside a viewing angle | LeetCode #1610 |
How to handle a question you have never seen
- 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.
- 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.”
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- Writing code silently in a shared document. The Google Doc removes compiler feedback, so narrate decisions and dry-run aloud.
- Chasing the optimal solution immediately. Deliver the baseline, state its complexity, then improve it when asked.
If you remember only five things
- Train for three problems in 90 minutes, not one perfect solution.
- Practise in a plain Google Doc; narrate while you type.
- Prepare your projects like a technical subject: architecture, contribution, trade-offs, scaling.
- Revise DBMS, OS and OOP alongside DSA; they appear inside technical rounds.
- 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
- InMobi SDE intern interview guide
- InMobi software engineer interview guide
- Zomato SDE 1 interview guide
- Flipkart software engineer interview guide
- Amazon software engineer interview guide
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).
Maximum Campaign Click-Through Rate
A InMobi online assessment question shared on Codinzhub (IIT Delhi).
Multiprocessor Job Scheduling
A InMobi online assessment question shared on Codinzhub (IIT Delhi).
Minimum Networking
A InMobi online assessment question shared on Codinzhub (IIT Kharagpur).
Cheapest Flights Within K Stops
A InMobi online assessment question shared on Codinzhub (IIT Kharagpur).
Common Intervals
A InMobi online assessment question shared on Codinzhub (IIT Kharagpur).
Company Audit Order With Cycle Detection
A InMobi online assessment question shared on Codinzhub (IIT Delhi).
Word Ladder With Per-Index Change Cost
A InMobi online assessment question shared on Codinzhub (IIT Delhi).
Median of Three Sorted Arrays
A InMobi online assessment question shared on Codinzhub (IIT Gandhinagar).
K-th Smallest Value in a Matrix
A InMobi online assessment question shared on Codinzhub (IIT Gandhinagar).
Count the subsets of an integer array whose sum equals a target.
Level: Not reported.
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.
Multi-source BFS on a 1-D array, similar to Rotten Oranges.
Level: Not reported.
Sliding-window string problem similar to Minimum Window Substring.
Level: Not reported.
For every tree node, compute the sum of distances to all other nodes.
Level: Not reported.
Connect N ropes with minimum total cost; parse a comma-separated input first.
Level: Parsing is part of the task.
Find the cheapest flight from a source to a destination with at most K stops.
Level: Not reported.
Decide whether all courses can be finished given prerequisite pairs.
Level: Not reported.
Maximum sum of nodes in a binary tree such that no two selected nodes are adjacent.
Level: Complexity; OOP and OS questions followed.
Word Squares: given equal-length strings, return every grid where row i equals column i.
Level: Optimise after the first working solution.
Keep preparing on Codinzhub
- InMobi interview questions and experiences — OA questions and interview experiences candidates shared for InMobi.
- Browse InMobi online assessment questions — filter the Codinzhub question bank by company.
- Paytm SDE 1 interview guide — the Paytm process, rounds and question patterns.
- Amazon Software Engineer interview guide — the Amazon process, rounds and question patterns.
- Google Software Engineer interview guide — the Google process, rounds and question patterns.
- All company interview guides — every guide on the Codinzhub blog.
Keep track of what you’ve learned.