Tag Archives: Inmobi

Inmobi Interview Experience | Set 4

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 O(n) time Round 2: Write a program for binary search. Discussed if any memory overflow problems occurs and how to resolve them. Left shift an unordered array by k times… Read More »