Online Interview Training Site
Cocktail Category
Posted on
20
Aug
2009 - by
Bishal-Nath In:
Algorithms/Coding, Cocktail
You have got 3 sorted arrays A1 A2 and A3 having m n and p elements respectively. A gap of 3 is defined to be max distance between 3 numbers if they are put on a number line say u pick three 2 12 and 7 then the gap is 10. Now u have to find an efficient way of choosing 3 numbers from these 3 separate arrays(A1,A2,A3) such that their gap is minimum. Of course if a num say 2 occurs in all 3 then gap is 0
Posted on
20
Aug
2009 - by
Bishal-Nath In:
Algorithms/Coding, Cocktail
There are N petrol pumps along a circular path. Every petrol pump gives some amount of fixed petrol. Need not to be unique and in no particular order means it is random. We have a car and we need to find a petrol pump which can provide so much of petrol that we can take a full round of the circle. Mileage of car is fixed
Posted on
20
Aug
2009 - by
Bishal-Nath In:
Algorithms/Coding, Cocktail
You are given a string. Develop a function to remove duplicate characters from that string. String could be of any length. Your algorithm must be in space. If you wish you can use constant size extra space which is not dependent any how on string size. Your algorithm must be of complexity of O(n)
Posted on
20
Aug
2009 - by
Bishal-Nath In:
Algorithms/Coding, Cocktail
Given a string ex: “aabccdcb”. Find all size palindrome of the given string
Posted on
20
Aug
2009 - by
Bishal-Nath In:
Algorithms/Coding, Cocktail