Home > OS >  Cookie monster problem: minimum moves to reduce all array elements to 0
Cookie monster problem: minimum moves to reduce all array elements to 0

Time:06-19

I am looking at the cookie monster problem:

The Cookie Monster has a table with piles of cookies, each pile a positive integer. The Cookie Monster must eat these cookies in the shortest possible sequence of moves. Each move consists of the Cookie Monster choosing an integer

  • Related