By suggestion of @Raihan142857, I have created my first general coding challenge! Solve a case of the unbounded knapsack problem; in particular, find a set of items in the Prices list whose prices sum to the Sum input. Output this set in the Prices To Sum list. The goals are shortest code, most efficient code, and fastest code. If there is no such set, then output an empty list. Your code must be able to handle all real numbers. (Negative prices exist in this awesome world.) You may buy an item more than once. If there are multiple solutions, pick the one with less items. If they are the same length, it doesn't matter which you pick. This problem is also called the change-making problem.
Have fun! @_-PJN-_, most efficient code: https://scratch.mit.edu/projects/405378356/ @CarciofoVolante, slightly nonworking: https://scratch.mit.edu/projects/405557788/ @kc021, shortest code: https://scratch.mit.edu/projects/405740833/
