Skip to main content
Admissions guidance, study banks, and career tools — get started on Shalyam

0/1 Knapsack

Given n items with weights and values and a knapsack of capacity W, print the maximum total value that can be carried. Each item can be taken at most once.

Constraints

1 <= n <= 100 1 <= W <= 10^4

Discussion

No discussions yet.

Rewards · v2.1

Get Exclusive Insights with Every Issue

Join Shalyam Newsletter

Stay ahead in education, research, and innovation—straight to your inbox.