InMobi

1. 1

   Coding test

   Online coding assessment (company coding contest)
   company platform60 minhard

   Section	Qs	Min	Topics
   Coding	-	-	dynamic programming, tries, backtracking, Fenwick tree, bit manipulation, string matching DP, cache design

   dynamic programming · tries · DFS backtracking · Fenwick tree · bit manipulation · LRU-style cache design

   One account reports 3 hard DSA questions, the other 2 standard DSA questions in 1 hour with no MCQs. The latter account's platform is unclear. Partial test-case credit makes brute force worthwhile.

2. 2

   Technical interview

   Round 2: DSA interview
   2 questionsonlinehard

   Fenwick tree · segment tree · coordinate compression · merge sort · stack · strings

   Single account; the other account reports no interview rounds at all.

3. 3

   Technical interview

   Final technical interview
   40 min2 questionsonlinemedium

   longest increasing subsequence · sorting trick for ties · sliding window · edge cases

   Scheduled for an hour, finished in about 40 min. No HR or behavioural questions.

Advice from candidates

47 pieces of advice, in their own words. Names removed.

• Do not jump directly into coding. First explain the brute-force idea, identify its complexity, and then move toward the optimized solution.

  interview · 2026-27

• Clearly justify the algorithm. Knowing that a problem is LIS, Segment Tree, or Sliding Window is not enough. Explain why the approach works.

  interview · 2026-27

• Discuss edge cases before coding. Consider empty inputs, duplicate values, equal dimensions, minimum/maximum values, and other boundary cases.

  interview · 2026-27

• Communicate while solving. In an interview, silent problem solving can make a correct solution look less convincing. Explain the key observations and decisions as you make them.

  interview · 2026-27

Loading the other 43…

Question patterns reported

The kind of problem, not the problem itself. Our practice questions are written to match these patterns.

• Codingtwo simultaneous grid paths maximising collected items
• Codingdictionary word search on a board using a trie
• Codingedit-distance variant with a wildcard-style cost
• Codingcache with capacity, timed puts and score-ordered queries
• Technicalcount inversions in an array
• Technicallongest well-formed bracket substring
• Technicalnested envelopes reduced to longest increasing subsequence
• Technicalvariable window with a validity condition
• Codingstandard graph traversal and shortest-path style problems
• Technicalvalidate a tree property with iterative dry-runs on examples
• Technicalspot production risks in a small file-handling snippet and fix it
• Technicaldesign classes for a food-ordering app
• Codingpick songs under a time cap maximising genre diversity, n at most 20
• Codingcache with view-count score, eviction and sorted query
• Codingminimum activations to clear all circular towers, n at most 20
• Technicalmaintain farthest pair distance as points are added
• TechnicalLRU cache design
• Technicalphone keypad contact search
• Technicalcircular array queue with known capacity
• TechnicalSQL-50 level queries needing WITH
• Technicalsort an array using two stacks
• Technicalbuffer incoming queries for a slower backend service
• Codingstock trading with limited transactions
• Codingtrapping water between bars