Skip to content
Related Articles

Related Articles

Inmobi Interview Experience | Set 4
  • Difficulty Level : Expert
  • Last Updated : 07 Dec, 2015

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 in O(n) time.

Round 3:
An island is represented in an 2d array of size mxn. If robot moves out of island it gets destroyed and robot is allowed to move top, down, left, right. Given a robot position (x, y) and k steps, what is the probability of robot getting survived in the effort of making k steps.

Given a subroutine which can be called in the flow of multi threaded web application. Track the number of times this subroutine is called without using synchronized keyword.

Best Regards

If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to See your article appearing on the GeeksforGeeks main page and help other Geeks.

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.   In case you are prepared, test your skills using TCS, Wipro, Amazon and Microsoft Test Serieses.

My Personal Notes arrow_drop_up
Recommended Articles
Page :