Any DP problem to share?

Question

No rodcutting,knapsack,coin change,subset sum, weighted scheduling, and ofc no fibonacci ;)
If you have a unique, or customized problem, but not too complex, please share :)
I'm currently learning to be more advanced, thanks

Answer 1

There are different algorithmic strategies to design an algorithm like greedy method ,dynamic programming,divide and conquer etc and each of the strategy has different types of problems and methods like
knapsack(0/1 and fractional), Prim's,Kruskal's,job sequencing with deadline, different sorting techniques ,strassens matrix multiplication whose time complexity is 0.2 less than normal matrix multiplication etc ....and so on.............