Hacker News new | past | comments | ask | show | jobs | submit login

>"I'll show you how to do DP"

Hey it's the same 3 example problems that are in every textbook, GeeksforGeeks, Leetcode, etc.




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!


Yeah, I was being snarky up above, but will definitely look forward to the future articles.




Join us for AI Startup School this June 16-17 in San Francisco!

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: