I have listed a few in the article. It's pretty common to see them in lectures and practical exercices. - longest common subsequence - longest common substrin

I have listed a few in the article. It's pretty common to see them in lectures and practical exercices. - longest common subsequence - longest common substring - line warp - subset sum - partition - knapsack You can also have a look at [1] for more ideas. [1] https://en.wikipedia.org/wiki/Dynamic_programming#Algorithms_that_use_dynamic_programming https://en.wikipedia.org/wiki/Dynamic_programming#Algorithms...