Skip to content

Tag Archives: InMobi

This article will give you information about the company, recruitment process, sample questions that have been asked previously, lots of experiences shared by other aspirants,… Read More
Round 1(Online Coding Round): It consisted of 3 coding questions to be solved in 1 hr 30 min. All three questions were equivalent to Leetcode… Read More
InMobi visited our campus and conducted their interviews in December. The recruitment procedure consisted of an online screening round followed by 2 technical rounds and… Read More
Imobi was hiring for role of software Engineer through codies Round 1 It was Online Round (4 questions) Round 2 Print longest balanced parenthesis. (… Read More
I recently got an opportunity of being interviewed at Inmobi after getting shortlisted for the Inmobi codies test. I was called for onsite interviews at… Read More
Given a text and a wildcard pattern, implement wildcard pattern matching algorithm that finds if wildcard pattern is matched with text. The matching should cover… Read More
Round 1: Discussed about projects Find two elements in BST such that their sum is k Given an array, find minimum positive integer missing in… Read More
Given a number line from -infinity to +infinity. You start at 0 and can go either to the left or to the right. The condition… Read More
I had an interview with Inmobi. Their process is written test followed by 3/4 f2f interviews. It was a drive over weekend. Written test: They… Read More
InMobi visited our campus twice, once for the written round, then for the personal interviews of the shortlisted candidates. So here is the written +… Read More
Serialization is to store the tree in a file so that it can be later restored. The structure of the tree must be maintained. Deserialization… Read More
Inmobi recently visited my campus and i got hired. I would like to share my experience. Round 1: 25 MCQ and 2 coding questions. It… Read More
Given an n x n matrix and an integer x, find the position of x in the matrix if it is present. Otherwise, print “Element… Read More
A height balanced binary tree is a binary tree in which the height of the left subtree and right subtree of any node does not… Read More
The problem is opposite of this post. We are given a stack data structure with push and pop operations, the task is to implement a… Read More

Start Your Coding Journey Now!