-
-
Notifications
You must be signed in to change notification settings - Fork 1.5k
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Added Descriptions to Classic DP Problems #1269
base: master
Are you sure you want to change the base?
Conversation
Added links to standard problems.
|
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Thanks for adding to my article. I agree that descriptions of the classical problems would be helpful. My original idea for the article was to link classical problems to internal articles on the website. I had been writing an article on 0-1 knapsack and subset sum but I'd gotten a little disheartened with the lack of enthusiasm for making the website better, so I hadn't finished it.
I'm not sure if linking externally for the classical problems would make sense. I do wonder if linking to examples of the problems makes sense given it's an introduction article. The problems I listed are basically on par with Fibonacci.
- Problems descriptions/examples are short and uniform. - Added separate list for topic (BitmaskDP, DigitDP and DP on Trees)
This pull request updates the section on classic dynamic programming problems by adding detailed descriptions for each problem. The aim is to enhance understanding and usability for users navigating through these problems.