InMobi Interview Questions, Process, and Tips

Maximum sub sequence sum in an array

• Use Kadane's algorithm

• Initialize max_so_far and max_ending_here to 0

• Iterate through the array and update max_ending_here and max_so_far

• Return max_so_far

Endianness refers to the byte order of a system. It determines how multi-byte data types are stored in memory.

• Little-endian systems store the least significant byte first, while big-endian systems store the most significant byte first.

• Endianness can affect the way data is transmitted between systems.

• To determine the endianness of a system, you can use the byte order mark (BOM) or write a test program that checks the by...read more

Sort an array of 0's and 1's only.

• Use two pointers, one at the beginning and one at the end of the array.

• Swap 0's from the beginning with 1's from the end until the pointers meet.

• Alternatively, use a counting sort algorithm to count the number of 0's and 1's and then reconstruct the array.

Heaps are data structures used to efficiently find the maximum or minimum element in a collection.

• Max heap: parent nodes are always greater than or equal to child nodes

• Min heap: parent nodes are always smaller than or equal to child nodes

• Heaps are commonly used in priority queues and sorting algorithms

• Heap operations include insert, delete, and extract max/min

• Example: An array [3, 8, 2, 5, 1, 4, 6] can be represented a

Find 3 numbers in an array where a+b=c.

• Loop through the array and check for all possible combinations of a and b.

• Use a hash table to store the values of a and b, and check if c is present in the hash table.

• Sort the array and use two pointers to find a and b, and then check if their sum equals c.

The program capitalizes the first letter of each reversed word in a sentence.

• Split the sentence into an array of words using space as a delimiter.

• Reverse each word in the array and capitalize the first letter.

• Join the modified words back into a sentence.

The program takes a string as input and capitalizes the first letter of each reversed word while keeping the rest of the letters in lowercase.

• Split the input string into an array of words using the space as a delimiter

• Iterate through each word in the array

• Reverse the word and capitalize the first letter

• Join the modified words back into a single string with spaces in between

I am a highly motivated individual with a passion for learning and achieving my goals.

• I have a degree in computer science and have worked as a software developer for 3 years.

• I enjoy volunteering at local charities and have organized several fundraising events.

• In my free time, I like to read books on personal development and travel to new places.

• I am a team player and enjoy collaborating with others to achieve common go

I learned about project management, teamwork, and communication skills during my summer internship.

• I gained experience in managing projects and meeting deadlines

• I learned how to work effectively in a team and communicate with team members

• I improved my problem-solving skills and learned to think creatively

• I gained knowledge about the industry and the company's operations

• I received feedback on my work and learned how to

InMobi is a global mobile advertising and discovery platform that reaches over 1.5 billion unique mobile devices worldwide.

• Founded in 2007 in India

• Offers a range of advertising formats including video, native, and display ads

• Provides data-driven insights to help advertisers reach their target audience

• Has partnerships with major brands and publishers such as Uber, Samsung, and ESPN

• Headquartered in Bangalore, India with ...read more

InMobi is a leading global mobile advertising platform with innovative ad formats and advanced targeting capabilities.

• InMobi has a strong presence in the mobile advertising industry

• Their ad formats are creative and engaging

• They offer advanced targeting capabilities for better ROI

• InMobi has a global reach with offices in multiple countries

• They have a strong focus on data privacy and security

I plan to pursue a master's degree in computer science.

• Researching universities with strong computer science programs

• Preparing for GRE exam

• Networking with alumni and professors for recommendations

• Applying for scholarships and financial aid

• Considering online or part-time programs for flexibility

To add 3 linked lists, traverse each list and add the corresponding nodes, carry over the remainder to the next node.

• Traverse each list and add the corresponding nodes

• Carry over the remainder to the next node

• Handle cases where the lists are of different lengths

Serialize and deserialize a binary tree.

• Serialize: Traverse the tree in pre-order and store the node values in a string with a delimiter.

• Deserialize: Split the string using the delimiter and create a new node for each value.

• Use a special character to represent null nodes.

• Recursively traverse the left and right subtrees to reconstruct the tree.

• Time complexity: O(n), Space complexity: O(n).

I am a highly motivated individual with a passion for learning and a strong work ethic.

• I have a degree in computer science and have worked as a software developer for 3 years.

• I am proficient in multiple programming languages including Java, Python, and C++.

• I am a quick learner and enjoy taking on new challenges.

• In my free time, I enjoy hiking and playing guitar.

I have worked on various projects including website development, mobile app development, and data analysis.

• Developed a responsive website for a local restaurant using HTML, CSS, and JavaScript

• Created a mobile app for a fitness center using React Native

• Analyzed customer data for a retail company using Python and SQL

• Collaborated with a team to develop a chatbot for a healthcare organization using Dialogflow

• Designed and i...read more

Find the first repeating element in an array of integers

• Create a hash table to store the frequency of each element

• Traverse the array and check if the element is already present in the hash table

• If yes, return the element as it is the first repeating element

• If no repeating element is found, return null

Find if there is a triplet in a Balanced BST that adds to zero

• Traverse the tree in-order and store the values in an array

• Use three pointers to find the triplet that adds to zero

• Start with the first pointer at the beginning of the array and the other two at the end

• Move the pointers towards each other until the sum of the triplet is found or all combinations are exhausted