Let's test your knowledge. Fill in the missing part by typing it in.
The optimized dynamic programming solution for the coin change problem uses a one-dimensional array to store the ___. This reduces the space complexity from O(N * amount) to O(amount).
Write the missing line below.
