Zero-one knapsack: maximize value under capacity without reusing an item

Zero-one knapsack: Given equal-length weights and values arrays and a capacity, return the maximum total value obtainable when every item may be selected at most once.

Input: A JSON object { "weights": number[], "values": number[], "capacity": number }.

Output: A JSON number containing the maximum value.

Constraints:

0 <= weights.length = values.length <= 1000
Weights are positive integers
capacity is a non-negative integer

Read one JSON value from stdin and print exactly one JSON-serialized answer to stdout with no extra text.

Difficulty: EASY. Variant: 7. Expect follow-up questions about complexity, edge cases, and alternative approaches.

Practice context

This coding (algo) exercise trains prompt interpretation, explicit assumptions, a concrete response, and a concise explanation of the decisions made. It is marked easy difficulty.

The signed-in workspace provides the

What this task practices

This coding (algo) exercise trains the same sequence expected in an interview: understand the prompt, make assumptions explicit, produce a concrete answer, and explain the decisions behind it. The task is marked easy difficulty. The private workspace adds the tools required by this round, such as recording, code execution, diagrams, evidence panels, or structured notes. It also preserves the attempt so later feedback can be compared with previous work. Evaluation is based on task-specific criteria and the candidate seniority selected in the preparation path. Public pages never expose the reference solution, hidden tests, evaluator instructions, or another candidate’s work.