Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

feat(dynamic programming -> knapsack): Update invalid example comment #268

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open

feat(dynamic programming -> knapsack): Update invalid example comment #268

Changes from 1 commit
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
660c737
feat(dynamic programming -> knapsack): Update invalid example comment
sathish-pv Oct 30, 2024
c4629a7
Update knapsack.ts
sathish-pv Nov 6, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion dynamic_programming/knapsack.ts
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -6,7 +6,7 @@
* @returns Maximum value subset such that sum of the weights of this subset is smaller than or equal to capacity
* @throws If weights and values arrays have different lengths
* @see [Knapsack](https://www.geeksforgeeks.org/0-1-knapsack-problem-dp-10/)
* @example knapsack(3, [3, 4, 5], [30, 50, 60]) // Output: 90
* @example knapsack(3, [3, 4, 5], [30, 50, 60]) // Output: 30
*/

export const knapsack = (
Expand Down
Loading