Ad

Wednesday, December 20, 2017

Coin Change Problem with Memoization and DP by Cracking the Coding Interview Author Tutorial Recommendation

This is another coin change problem tutorial we recommend. This one is by Cracking the Coding Interview (the bible of coding interview) author Gayle Laakmann Mcdowell. The explanation is crystal clear and very helpful. The only thing it didn't cover in depth is the idea of using a coin (reduce sum) and withholding a coin (not reducing the sum) while increasing the index to process the next coin. This is also a memoization and dynamic programming problem.







Previously we recommended Coin Change problem by O'Neill Code. That one uses a bottom up greedy approach to solve for smaller denominations. Then add the ways up as approaching bigger denominations. http://www.siliconvanity.com/2017/11/coin-change-problem-dyanmic-programming.html

2 comments:

  1. Hey its beautiful post really. It really made me so excited. Such skillful and capable writings are appreciated on every forum. Every woman should read this post. Great effort indeed.

    ReplyDelete
  2. Hi, I read your blog like every week. Your story-telling style is
    witty, keep doing what you’re doing!
    www.gumawawebsite.blogspot.com

    ReplyDelete

Matplotlib Explained - Kite Blog

  If Jupyter Notebook is the new Excel, the horsepower of data science (visualizations, presentations and demos), Matplotlib is...