InMobi CTC 55 LPA OA QUESTIONS 2026

410
Oct 10, 2026

Hi Everyone, Recently I gave Inmobi online assessment for the profile of SDE I, I found the questions quite unique so sharing them for the community here :

  1. There was a long story which I don't remember, but here is the gist of the question as I remember it, you are given an array of size N and M queries of form (li, ri) and basically we had to return maximum subarray sum from range (li,ri) for all the queries, 1<=N<=50000, -15000<= A[i] <= 15000, 1 <= (li,ri) <= N, 1 <= M <= 50000
  2. Again long story was there, but the gist is We are given a string of S length N, and another shorter string U,of length M, we have to return the number of substrings of N that are equal to U, but the twist is, if the position of 2 consecutive elements are swapped then also it's a valid match ex. S = abcacbabc, and U = abc then we have to find abc, acb, bac inside S and retur the number of matches, constraints were 1<= M <= N <= 200000, answer is guaranteed to be a 32 bit signed intenger
  3. A microservice platform have N services, from 1 to N, some services depend on another services, ex. if A depends on B, then if we start B service A will automatically start, a service with no dependencies can never start on it's own and any service can be cold started, we have to find the minimum number of cold starts that we need to do in order to start all the services, 1<= N <= 1e5, 0<= M <= 2*1e5, where M is number of dependencies
  4. Was a follow-up of question 1, we are given an array of size N representing profit and loss incurred on ith day, M queries of the form x1,y1,x2,y2 where x1,y1 is the opening window and x2,y2 is the closing window, position must open on day i with x1<= i <= y1 and close on day j with x2 <= j <= y2 , it covers the unbroken stretch a[i] + a[i+1] + .... + a[j], for each query we had to return the maximum subarray sum, since the question might be unclear here is an example, n = 5, a = [10,-40,-30,30,40] , m = 2, 1 3 3 5 and 2 4 3 5 answer is for first query best run is from day 3 to day 5 ans = 40, for 2nd query best run is from day 4 to day 5, ans = 70
    that's all, wish you all the very best :>
Comments (2)