solulubeta
Sign in
Story Problems / Dynamic programming
07.15 · Problem

Trip Backpack

Medium 2-D DP · 0/1 knapsack Pro

This problem is part of solulu Pro

Sneha's backpack can carry at most capacity kg. There are n items, item i weighs w[i] and gives v[i] happiness. Each item can be taken at most once. What is the maximum total happiness she can carry?

Lifetime ₹2,000 ₹1,000 · Beta offer
Mark this problem as solved when you are finished.

Item 89 of 94 · updated 2026-10-12