Online Interview Training Site
Cocktail Category
Posted on
20
Aug
2009 - by
Bishal-Nath In:
Algorithms/Coding, Cocktail
You are given with an array of integer and the length of array. Now u have to find an index i such that a(i)=i; O(logn)sol is fine if it(index i) exits. But if there is no such index you are unnecessarily checking it in O(logn)
Posted on
20
Aug
2009 - by
Bishal-Nath In:
Algorithms/Coding, Cocktail
input: a array of two elements having value 0 and 1; output: make both elements 0; specifications : i) it is guaranted that one element is 0 but we do not know its position. ii) we can’t say about another element it can be 0 or 1. iii) we can only complement the element. iv) no other operation is allowed (and, or, multi, division…. etc.)
Posted on
20
Aug
2009 - by
Bishal-Nath In:
Algorithms/Coding, Cocktail
Given a dart board of radius `r’, and if a dart is thrown on the board which always falls inside assuming uniform distribution, find the expected distance from the center for the point where the dart lands
Posted on
20
Aug
2009 - by
Bishal-Nath In:
Algorithms/Coding, Cocktail
How will you find the kth smalllest element
Posted on
20
Aug
2009 - by
Bishal-Nath In:
Algorithms/Coding, Cocktail