← Amazon questions

Unbounded Knapsack problem

Filed under Amazon · Also reported at Swiggy

Given weights and values of N items, and a knapsack of capacity W, find the maximum total value items can have if each item can be selected an unlimited number of times.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Amazon questions

Collected from public candidate posts and coding forums. Updated Nov 2026.