Aditya_Ramesh

Yeah, I'm currently looking into them - I'm new to the field and exploring existing solutions to see what works best and what's also computationally feasible since the end user would mostly have limited access to powerful hardware.

That sounds good to me - I'll do that as soon as possible.

And thanks for the nice words!

Thank you! I'll make sure to go over some non-classical problems in my next article on DP to add more value :)

Thanks for pointing out the typo! I'll fix that right away.

And in regards to the "global variable", my variable 'dp' is my cache array. It's where I'm storing my precomputed results.

If I don't modify it, it's not DP anymore, it's plain recursion. :)

I guess I should've mentioned that the actual memoization table is an exception.

Anyway, thanks for reading my article! :)

Thanks for taking the time to read my post. :) Like I mentioned, this article only lays the groundwork. The next article I intend to write on is DP+Strings (for example, finding the longest substring of a string which is a subsequence of another, etc)

I'm starting with classical problems and I'll soon diverge into non-classical problems, as I've mentioned in my article too.

In any case, hope my other articles on my blog added more value to you in comparison!