InMobi Interview Report
- 0of 0 votes
AnswersYou are given n variable length sets with each set like set1: [s1.....e1], set2:[s2.....e2] with the condition that the sets overlap (i.e. if you represent them on number line, they intersect). Now you have to remove the minimum number of sets from here so that the remaining sets are disjoint.
- ashu February 19, 2012 in India
For example you have set S1, S2, S3 with S1 and S3 disjoint and S2 overlapping both S1 and S3 then we remove S2 to get the answer.| Report Duplicate | Flag | PURGE
InMobi Algorithm - 0of 0 votes
AnswersYou are given an unsorted array with both positive and negative elements. You have to find the smallest positive number missing from the array in O(n) time using constant extra space.
- ashu February 19, 2012 in India
Eg:
Input = {2, 3, 7, 6, 8, -1, -10, 15}
Output = 1
Input = { 2, 3, -7, 6, 8, 1, -10, 15 }
Output = 4| Report Duplicate | Flag | PURGE
InMobi Algorithm
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.