← Snapdeal questions

0/1 Knapsack Problem

Filed under Snapdeal · Also reported at Adobe, Azuga Telematics, ClearTrip, Cognizant, Delhivery, DeltaX, FactSet, Flipkart and 6 more

Given weights and values of n items, put these items in a knapsack of capacity W to get the maximum total value in the knapsack. You cannot break an item, either pick the complete item or don't pick…

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

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