Hi, I read your ebook, and I was wondering if you could tell again why you think DP is better for the CoinChange than a Greedy algorithm? A Greedy one works for every time and takes like 12 lines at O(n*coins). PD seems like a huge overkill to me.