🎉 Exercism Research is now launched. Help Exercism, help science and have some fun at research.exercism.io 🎉
Track Java
Java track

Knapsack

An exercise from the Java track
medium

About this exercise

Given a knapsack that can only carry a certain weight, determine which items to put in the knapsack in order to maximize their combined value.

algorithms
arrays
conditionals
View all solutions