Solve it without division operator and in O(n).
Bookmark it!
These icons link to social bookmarking sites where readers can share and discover new web pages.
Entries Tagged as 'Google'
There is an array A[N] of N numbers. You have to compose an array Output[N] such that Output[i] will be equal to multiplication of all the elements of A[N] except A[i]. For example Output[0] will be multiplication of A[1] to A[N-1] and Output[1] will be multiplication of A[0] and from A[2] to A[N-1].
June 18th, 2008 · 3 Comments · Algorithms, Google
Tags:interview quetsion·placements paper
You have 1000 integers. All are less than 1000 and greater or equal to 1. Among them, 999 are distinct and there is one that is found twice. How can you find the duplicate?
June 18th, 2008 · 3 Comments · Algorithms, Google
Extension to this questions is - if there are some billion numbers are there, and you have enough memory to fit all these numbers. What is the best of to do the same?
Bookmark it!
These icons link to social bookmarking sites where readers can share and discover new web pages.
Tags:interview question·placements paper
if I had to find duplicates in book catalogs with entries with different titles but with the same content..
June 18th, 2008 · 2 Comments · Algorithms, Google, Placements
This is related to google print application. In other words, we have many books out of which some books titles were different but content same. We need to figure out such cases efficiently. How?
Bookmark it!
These icons link to social bookmarking sites where readers can share and discover new web pages.
Tags:interview question·placements paper
If we would like to index the entire earth population, how long should the index size be?
June 18th, 2008 · No Comments · Google, Placements
Really, it was asked in google interview. Of course, this is pretty much similar to classic questions like how many gas stations in the united states?
can anybody help? best of all answers comes here …
Bookmark it!
These icons link to social bookmarking sites where readers can share and discover new web pages.
Tags:
Create a function, called findZeros(), that will compute the number of zeros in the decimal representation of n!
June 18th, 2008 · No Comments · Algorithms, Google
For example, 5! = 1.2.3.4.5= 120 has one zero and 10! = 1.2.3.4.5.6.7.8.9.10 = 3628800 and has two zeros.
can anybody help? best of all answers comes here …
Bookmark it!
These icons link to social bookmarking sites where readers can share and discover new web pages.
Tags:Google·placements paper
Create a function, called powerSet(), that will output the power set of the input set.
June 18th, 2008 · 1 Comment · Algorithms, Google
The power set in Algebra theory is the set of all subsets of a set
(no..bull-set!) If a set has N elements then the power set will have
2^N elements. So if a set is denoted by {a,b} with a,b as elements then
the power set is { {},{a},{b},{a,b} }.The {} is the empty set.
Can anybody help? best […]
Tags:algorithm·Google·placements question·power set
GOOGLE PAPER - Sept, 2006 - CHENNAI
September 3rd, 2006 · No Comments · Google, Placements
Test consist of 15 question based on C, C++, and Data Structure and two C programs. So i am listing some of the question as i remembered.
Q1) What is the value of i after execution of the following program.
void main()
{
long l=1024;
int i=1;
while(l>=1)
{ l=l/2;
i=i+1;
}
}
a)8 b)11 c)10 d)100 ans:b
Q2) This question is based on the complexity […]
Tags: