After months of studying dynamic programming, I can finally say with confidence that I UNDERSTAND NOTHING.

There is the reference.

Dynamic programming seems from a short read through to be s sub set of a recursive algorithm where 1. All data is known from the start, 2. There exists an optimal solution, possibly involving multiple weighted resulting values, 3. where intermediate values can be reused, thats the overlapping part in the description. I no intermediate is reused its apparently called “divide and conquer” but except for the memoization is almost the same.

Its more a mathematical description as far as I understand since the actual implementation is more or less recursion with memoization (storing already computed deterministic results).

Here are the links I checked

https://educative.io/courses/...

https://en.m.wikipedia.org/wiki/...

I assume this is for some school project?

When I have to learn dynamic programming, I learn it from start. So yeah, we are on the same page. It gets easier every iteration, though. Because it feels like a revision more than learning.

@Voxera Thanks for the resources. I will check them out. No, I'm done with school. This is for personal learning.

@Cyanide
> It gets easier every iteration, though. Because it feels like a revision more than learning.

You mean like a bottom-up approach.

@rantsauce bottom-up as in?

@Cyanide It's a DP pun. https://stackoverflow.com/questions...