Add 0/1 Knapsack Problem using Dynamic Programming

[ChaitanyaShah26]

Description of Change

I have added a new code for the 0/1 Knapsack Problem which follows a Dynamic Programming approach.

References

None

Checklist

• Added description of change
• Added file name matches File name guidelines
• Relevant documentation/comments is changed or added
• PR title follows semantic commit guidelines
• Search previous suggestions before making a new one, as yours may be a duplicate.
• I acknowledge that all my contributions will be made under the project's license.

[github-actions]

This pull request has been automatically marked as abandoned because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.