MoncefME / knapsack-01

Basic implementation of Knapsack-01 problem using dynamic programming

Knapsack-01 Solver Website

This is the implementation of the Knapsack-01 problem using Dynamic Programming ,

How It works :

• Enter the capacity of the knapsack
• Enter the Number of Element
• Enter the Value and the Weight of each element , name is optional
• Calculate the Maximum value of elements which can fit into the Knapsack of that capacity

Ressources :

• GeeksforGeeks Article
• This Youtube Video
• This Youtube Video
• V0 by Vercel to speed up front-end

Check the Main Branch for the code and tests