Knapsack problem/0-1

The 0-1 knapsack problem is defined as follows:

You are given an array of objects representing items to be put in a knapsack. The objects have 3 attributes: name, weight, and value. The items need to be selected so that the total weight does not exceed the maximum weight and the value is maximized.

Test

Boilerplate code

Console output

Shortcuts on this page

Use Cmd instead of Ctrl if you're on a Mac.

`g`	Focus editor
`Ctrl`-`Enter`	Run the test with current code
`Ctrl`-`Shift`-`K`	Reset the editor
`Ctrl`-`Shift`-`L`	Clear console output
`Ctrl`-`Shift`-`X`	Show the solution
`[`	Previous challenge
`]`	Next challenge
`T`	Back to top page
`?`	Show this dialog
`ESC`	Hide this dialog
`Shift`-`ESC`	Blur focus from editor