Thursday Code Puzzler: The Knapsack Problem
Join the DZone community and get the full member experience.
Join For FreeThursday is code puzzler day here at DZone. The idea is
simple: solve the coding problem as efficiently as you can, in any
language or framework that you find suitable.
Note: Even though there really is nothing stopping you from finding a solution to this on the internet, try to keep honest, and come up with your own answer. It's all about the participation!
Do you have code puzzlers that you'd like to share with the DZone community? If so, please submit here.
The Knapsack Problem
Given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit, and the total value is as large as possible
Catch up on all our previous puzzlers here.
Opinions expressed by DZone contributors are their own.
Trending
-
AI and Cybersecurity Protecting Against Emerging Threats
-
10 Traits That Separate the Best Devs From the Crowd
-
Manifold vs. Lombok: Enhancing Java With Property Support
-
Integrate Cucumber in Playwright With Java
Comments