Dynamic Programming

Coin Change: Bottom-Up and Top-Down Dynamic Programming

2 min read Coin Change (LeetCode 322) is the canonical dynamic programming problem. It tests your ability to identify optimal substructure, choose between […] Read article