GeeksforGeeks
Question
·
Dec 2015
·
San Francisco
Inmobi Interview Experience | Set 4
Question Details
Round 1:Discussed about projectsFind two elements in BST such that their sum is kGiven an array, find minimum positive integer missing in O(n) timeRound 2:Write a program ...
Full Details
🔒
Unlock all Inmobi questions
Full insider details, leaked discussions, and candidate experiences.
Get full access — $100 a year, unlimited accessAbout This Question
This is a reported interview question from a inmobi interview for a swe role during the phone screen round reported in 2015.
It covers the following topics: Trees, Binary Tree, Binary Search, Probability Stats, Arrays, Matrix .