โ† Zoho questions

Minimum Value Subset for Sack Weight

Filed under Zoho

Given n items each with a value and weight, and a knapsack capacity W, find a subset of items whose total weight meets or exceeds W such that the total value is minimized.

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 Zoho questions

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