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 »
I had an interview with Inmobi. Their process is written test followed by 3/4 f2f interviews. It was a drive over weekend.
InMobi visited our campus twice, once for the written round, then for the personal interviews of the shortlisted candidates.
Inmobi recently visited my campus and i got hired. I would like to share my experience.