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

Check the Main Branch for the code and tests

Name		Name	Last commit message	Last commit date
Latest commit History 4 Commits
app		app
components		components
lib		lib
public		public
.gitignore		.gitignore
README.md		README.md
components.json		components.json
next.config.js		next.config.js
package-lock.json		package-lock.json
package.json		package.json
postcss.config.js		postcss.config.js
tailwind.config.ts		tailwind.config.ts
tsconfig.json		tsconfig.json