← Nagarro questions
CodingReported in a candidate post, Jul 2025

0-1 Knapsack variation

Filed under Nagarro · Also reported at Cogno AI, Salesforce

Given `n` floors where each floor `i` has a weight `weights[i]` and diamond value `values[i]`, and a bag with capacity limit `capacity`, find the maximum diamond value that can be collected without…

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

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