Expanding Dynamic Programming Problem list with Categorized Problems

[Manish15559]

Select the Day of Content

others

What information is missing?

Dynamic programming is a crucial component of data structures and algorithms (DSA) and is frequently tested in technical interviews. The existing dynamic programming problem list lacks sufficient depth and variety. This issue aims to address this gap by adding more than 50 new problems, categorized by difficulty level and problem pattern/type. The enhanced structure is designed to provide a comprehensive and organized resource for learning and mastering dynamic programming.

Changes Introduced :

• Expanded Problem Set: Adding 50+ new dynamic programming problems.

• Categorization by Difficulty: Problems are divided into Beginner, Intermediate, and Advanced levels.

• Categorization by Pattern/Type: Problems are further categorized by common dynamic programming patterns, including 1D DP, 2D DP, Knapsack Problems, String Problems, Sequence Problems, Game Theory Problems, and Bitmasking Problems.

[github-actions[bot]]

Thank you for creating this issue! We'll look into it as soon as possible. Your contributions are highly appreciated! 😊

[Manish15559]

hello @subhadipbhowmik please assign this issue to me