[PR #1500] Add 0/1 Knapsack Problem using Dynamic Programming #2108

New Issue

claunia · 2026-01-29T15:28:48Z

claunia commented

2026-01-29 15:28:48 +00:00

Original Pull Request: https://github.com/TheAlgorithms/C/pull/1500

State: closed
Merged: No

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.

**Original Pull Request:** https://github.com/TheAlgorithms/C/pull/1500 **State:** closed **Merged:** No --- #### Description of Change I have added a new code for the 0/1 Knapsack Problem which follows a Dynamic Programming approach.  #### References None  #### Checklist  - [x] Added description of change - [x] Added file name matches [File name guidelines](https://github.com/TheAlgorithms/C/blob/master/CONTRIBUTING.md#File-Name-guidelines) - [x] Relevant documentation/comments is changed or added - [x] PR title follows semantic [commit guidelines](https://github.com/TheAlgorithms/C/blob/master/CONTRIBUTING.md#Commit-Guidelines) - [x] Search previous suggestions before making a new one, as yours may be a duplicate. - [x] I acknowledge that all my contributions will be made under the project's license.

claunia added the pull-request label 2026-01-29 15:28:48 +00:00

Sign in to join this conversation.

1 Participants

Notifications

Due Date

No due date set.

Dependencies

No dependencies set.

Reference: starred/C#2108