Google Interview Report
- 4of 4 votes
AnswersGiven N pens and n caps . Sort them. you cant compare pens with other pens and caps with other caps
- Anonymous July 29, 2011| Report Duplicate | Flag | PURGE
Google - 0of 0 votes
Answerslet f(n, k) be the # of ways of choosing k integers without replacement from
- Anonymous July 29, 2011
n consecutive integers so that no two selected are consecutive.
a. give a recurrence for f(n, k)
b. efficient implementation of f(n, k)| Report Duplicate | Flag | PURGE
Google Algorithm
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.