A friend of mine was asked this question for an interview and couldn’t solve it at that moment. Thought I would share the same.
There are a thousand choco-chip cookies with one of them poisoned. You
have access to 10 lab rats per day. Each rat can nibble on any number
of cookies and each cookie can be nibbled by any number of rats. After
a rat nibbles on a poisoned cookie, it takes a day to see the after
effects on the rat if it were poisoned.
Optimize on the number of days. I was able to come up with an algorithm to find the poisoned cookie in 2 days, although I believe there exists a way to do this in 1 day
I think I got it.
Imagine a binary tree with the 1024 cookies as the root (This number just comes out cleaner, but this will work for any number less than 1024). Break that 1024 cookies into two groups of 512, each of those groups is the child of the root. Then break each of those groups of 512 into groups of 256 and let those be the children of each of them and so on. You should end up with 11 levels of the tree.
Assign each rat to a level of the tree except the root. Each rat will eat only the cookies on the left branches of their level. The next day, iterate through the tree and for each rat that died, follow the left branch, for each rat that lived, follow the right branch. The resulting cookie should be the poisoned one.