...
/Challenge 2: The Knapsack Problem
Challenge 2: The Knapsack Problem
In this lesson, we will go over another famous dynamic programming problem, the Knapsack problem.
We'll cover the following...
A thief has broken into a house; the house has many valuable goods but unfortunately, the thief only brought a knapsack with a limited capacity. Every good in the house has a value in dollars and weight in kilograms associated with it. The thief wants to maximize the utility of his trip and take back the goods that fit his knapsack and earn him the highest possible money. ...