Cookies and candy

Questions 1 to 5 of 7

1. 1. What does this print? ``python print(content_children([1, 2, 3], [2, 2])) ``

   1203
2. 2. What does this print? ``python a = [3, 1, 2] b = a b.sort() print(a) print(b) ``

   [3, 1, 2] then [1, 2, 3][1, 2, 3] then [1, 2, 3][1, 2, 3] then [3, 1, 2][3, 1, 2] then [3, 1, 2]
3. 3. A program gives each child the biggest cookie that fits, instead of the smallest. For greed values [1, 2] and cookie sizes [1, 3], it returns 1. Why?

   The sort puts the cookies in descending order, so the walk stops after the first child.The size 1 cookie is skipped because it is too small for everyone, so only one cookie is ever used.The child who needs 1 takes the size 3 cookie, so the child who needs 2 is left with only the size 1 cookie, which is too small.Two children can never share a cookie size, so the count is capped at one.
4. 4. Both sweeps of the candy function use >= instead of >. What counts does it return for ratings [1, 2, 2]?

   [1, 2, 3][2, 2, 1][1, 4, 3][1, 2, 1]
5. 5. What is the time and extra space cost of the candies function, for n children?

   O(n) time and O(n) extra space, because the two sweeps visit each child once and the candy list holds one number per child.O(n^2) time and O(1) extra space, because each child is compared with every other child.O(n log n) time and O(1) extra space, because the children must be sorted first.O(n) time and O(1) extra space, because the counts are updated in place.