Added 0/1 Knapsack Algorithm using Dynamic Programming in Java #6789
+41
−18
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
n
items 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.java
Example:
Enhancement Type: Dynamic Programming Algorithm
This contribution is part of Hacktoberfest 2025 🎉