← Accenture questions
CodingEasy to Medium

Explain Dynamic Programming and solve Knapsack

Filed under Accenture

Given N items, each with a weight weights[i] and a value values[i], and a knapsack capacity W, determine the maximum total value of items that can fit into the knapsack. Each item can either be picked…

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

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