← Arcesium questions

Modified 0-1 Knapsack with single item weight change

Filed under Arcesium

Solve a variant of the 0-1 knapsack problem where you are given a set of items with weights and profits, and you are allowed to modify the weight of at most one item to a new value to maximize the…

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

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