Re:Dynamic Programming for Technical Interviews
by bspammer on Friday March 15, 2019 @10:18AM
(#19399895)
I don't know what version of the problem you solved, but generally you are limited by the number of eggs you are allowed to use. Say you have a hundred floors and 1 egg, binary search would drop an egg from the 50th floor, have it break (assuming the key floor was <50), and then promptly fail.
[ Parent
| on HN ]
There are no comments on this comment yet.