Algorithms Explained #5: Dynamic Programming
Explanation of dynamic programming with example solutions to discrete knapsack and longest common subsequence problems in Python
Published in
5 min readOct 12, 2022
Dynamic programming is useful for solving problems that have overlapping subproblems and an optimal substructure. In the previous article on greedy algorithms, we talked about…
