← Goldman Sachs questions

Knapsack Variation with Item Array Output

Filed under Goldman Sachs

Given weights and values of items, find the subset of items that maximizes total value without exceeding a capacity W, and return the items themselves.

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 Goldman Sachs questions

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