|
Order the functions in order of their asymptotic performance
1) 2^n
2) n^100
3) n!
4) n^n
http://linkmingle.com/details/1371
created by interview_questions on 2008-06-23 04:32:13
|
|
How long it would take to sort 1 Trillion numbers? Come up with a good estimate .
http://linkmingle.com/details/1369
created by interview_questions on 2008-06-22 23:13:37
|
|
You need to check that your friend, Bob, has your correct phone number, but you cannot ask him directly. You must write a the question on a card which and give it to Eve who will take the card to Bob and return the answer to you. What must you write on the card, besides the question, to ensure Bob can encode the message so that Eve cannot read your phone number?
http://linkmingle.com/details/1225
created by interview_questions on 2008-06-19 01:52:51
|
|
You have to get from point A to point B. You dont know if you can get there. What would you do?
http://linkmingle.com/details/983
created by interview_questions on 2008-06-11 22:33:33
|
|
Assuming 10,000 city blocks, 600 windows per block, five minutes per window, and a rate of $20 per hour, about $10 million
http://money.cnn.com/2007/08/29/technology/brain_t
created by interview_questions on 2008-06-11 21:49:29
|
|
There is linked list of millions of node and you do not know the length of it. Write a function which will return a random number from the list.
http://linkmingle.com/details/945
created by interview_questions on 2008-06-09 23:10:22
|
|
Suppose we have N companies, and we want to eventually merge them into one big company. How many ways are there to merge?
http://linkmingle.com/details/884
created by interview_questions on 2008-06-05 05:26:29
|
|
Given that you have one string of length N and M small strings of length L . How do you efficiently find the occurrence of each small string in the larger one ?
http://linkmingle.com/details/883
created by interview_questions on 2008-06-05 04:41:26
|
|
How do you find out the fifth maximum element in an Binary Search Tree in efficient manner.
http://linkmingle.com/details/882
created by interview_questions on 2008-06-05 04:29:05
|
|
There is an array A[N+1] of N integers. You have to compose an array Output[N+1] such that Output[i] will be equal to the productof all the elements of A[] except A[i].
Example:
INPUT:[4, 3, 2, 1, 2]
OUTPUT:[12, 16, 24, 48, 24]
Solve it without division operator and in O(n) with out using division.
http://linkmingle.com/details/865
created by interview_questions on 2008-06-04 23:58:34
|
IndiaDiscuss.com : Social Bookmarkings and News Networking Site for India
RSS
Save Link 
Create/Add to List
