Added 0/1 Knapsack Algorithm using Dynamic Programming in Java#6789
Merged
DenizAltunkapan merged 7 commits intoTheAlgorithms:masterfrom Dec 29, 2025
Merged
Conversation
Codecov Report✅ All modified and coverable lines are covered by tests. Additional details and impacted files@@ Coverage Diff @@
## master #6789 +/- ##
============================================
- Coverage 78.92% 78.91% -0.01%
+ Complexity 6884 6883 -1
============================================
Files 774 774
Lines 22747 22746 -1
Branches 4469 4468 -1
============================================
- Hits 17952 17949 -3
- Misses 4076 4077 +1
- Partials 719 720 +1 ☔ View full report in Codecov by Sentry. 🚀 New features to boost your workflow:
|
DenizAltunkapan
approved these changes
Dec 29, 2025
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
💡 Description
This PR adds the 0/1 Knapsack Algorithm implemented in Java using a bottom-up Dynamic Programming approach.
Problem Statement:
Given
nitems with certain weights and values, and a knapsack with weight capacityW, determine the maximum total value without exceeding the capacity. Each item can either be included or excluded (0/1 condition).File Path:
src/main/java/com/thealgorithms/dynamicprogramming/Knapsack.javaExample:
Enhancement Type: Dynamic Programming Algorithm
This contribution is part of Hacktoberfest 2025 🎉