GeeksforGeeks Experience · Dec 2015

Inmobi Interview Experience | Set 4

Interview Experience

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 full leaked content

Full insider details, leaked discussions, and candidate experiences.

Get Premium →

Topics

Arrays Trees Binary Search Probability Stats