Company OAsAll ProblemsPlacement DataInterview ExperiencesPremium
OAHelper

Built by students, for students - practice company-specific OAs, DSA sheets, and real interview experiences to land your dream role.

© 2026 OAHelper.in·Terms·Privacy·Refunds·Trust & Safety·Contact·
Ready to crack your next OA?

Practice company-specific questions trusted by thousands of students across India.

Start PracticingGo Premium
OA Practice·DSA·Placements

Disclaimer: OAHelper is an independent educational platform. We (oahelper.in) do not own the images or questions shown. Content is uploaded by users.

InMobi_3rdaug OA Questions 2026 — Online Assessment & Interview Practice

6 real InMobi_3rdaug online assessment questions from recent interviews. Includes coding rounds, MCQs, and InMobi_3rdaug interview preparation tips for SDE Intern, New Grad, and full-time roles.

  • Wildcard Conversion Cost
  • Minimum Path Sum
  • Temporal Anomalies
  • Minimum Chain Joining Cost
  • Cheapest Flights Within K Stops
  • Employee Reportees
Browse All CompaniesInterview ExperiencesPlacement DataInMobi_3rdaug Dynamic Programming OA questions (3)InMobi_3rdaug Graph Theory OA questions (2)InMobi_3rdaug Heap (Priority Queue) OA questions (2)InMobi_3rdaug Binary Indexed Tree OA questions (1)InMobi_3rdaug Breadth-First Search OA questions (1)InMobi_3rdaug Depth-First Search OA questions (1)InMobi_3rdaug Divide and Conquer OA questions (1)InMobi_3rdaug dynamic-programming OA questions (1)
All Companies
I

InMobi_3rdaug OA Questions

6 QuestionsOnline Assessment
0 / 6 solved in this company0% complete
01

Wildcard Conversion Cost

Dynamic ProgrammingString+1Dynamic ProgrammingStringEdit Distance
02

Minimum Path Sum

dynamic-programminggriddynamic-programminggrid
03

Temporal Anomalies

SortingBinary Indexed Tree+3SortingBinary Indexed TreeDivide and ConquerDynamic Programming+1
04

Minimum Chain Joining Cost

GreedyHeap (Priority Queue)GreedyHeap (Priority Queue)
05

Cheapest Flights Within K Stops

Dynamic ProgrammingBreadth-First Search+3Dynamic ProgrammingBreadth-First SearchGraph TheoryHeap (Priority Queue)+1
06

Employee Reportees

TreeDepth-First Search+2TreeDepth-First SearchGraph TheoryRecursion
Solve